icen

7 ms·

1.
by icen 3mo ago
I’m greatly enjoying my Charybdis nano: the built in trackball makes using the mouse just as convenient as the keyboard
2.
by icen 4mo ago
Numpy doesn’t quite get it. It covers the core verbs, but it opts for specialised names instead of using adverbs (you can apply your own, but it’s much more laborious). Once you see +/, you understand ,/ or fn/ - whereas you
3.
by icen 4mo ago
There's also the much less vector oriented spelling: (1 ∾˜ " "⊸(¬∘⍷))⊸/ which removes the first space of each occurrence of double spacing
4.
by icen 4mo ago
Do you remember what it was? This is how I would spell that in BQN, and you could write something very similar in APL (you don't have shift, so you'd have to write 1 drop 0 cat swap instead) ((«¬∘∧⊢)' '=⊢)⊸/
5.
by icen 5mo ago
It's clear that the symbols want to have one meaning each, for monadic and dyadic use, but that might mean quite different execution and types. For example, & is monadic 'where' and dyadic 'min' (a logical exten
6.
by icen 8mo ago
There’s nonguix for access to non free drivers and such. I think that system crafters have some installable images if you don’t have a current guix install to build one It’s regrettable that this is necessary, but with so few Ethernet ports
7.
by icen 8mo ago
You might be interested in this then: https://mlajtos.mu/posts/new-kind-of-paper I’ve not used it myself, but it appears to be the thing you’re wanting?
8.
by icen 11mo ago
In helix that's %d (select-buffer, then delete). The selection-then-action design for helix is showing it's difference to vi, which is action-on-movement.
9.
by icen 1y ago
It is BQN, a descendant language
10.
by icen 1y ago
Yes; the CBQN interpreter has a number of specialised vectorised codepaths. It picks a good one for the arrays at runtime.
11.
by icen 1y ago
In K the arguments are named x y z by default, so you just write: { foo[x, bar] }
12.
by icen 2y ago
Looks like K to me!
13.
by icen 2y ago
> I didn't understand how this connects to the first paragraph at first, but I think you're saying this playthrough is an analog to someone making such documentation, thus saving DF from such a fate? (Not OP) Possibly, but one
14.
by icen 2y ago
> For character-based movement, simply press 'z' to enter the column mode. I did eventually find this in the documentation, under the "regexp selections" section. I think it should be more prominently displayed in oth
15.
by icen 2y ago
In this respect, probably nothing, and they probably all mean Q. Q is a different language to K, implemented in K. There are more versions of K than Q- kdb+ is the only Q implementation, but there are others like shakti, ngn/k, and kon
16.
by icen 2y ago
Or indeed just results*:2
17.
by icen 2y ago
It returns it for 404 as well: https://http.cat/does/not/exist
18.
by icen 3y ago
I don't want to do the same things for boolean operations, or arithmetic, or pointer (de-)referencing in C like languages. Why would I want to do so when equally familiar with a larger range of symbolic operations? Somehow the usual cu
19.
by icen 3y ago
I'm solving in BQN, and my workflow is repeatedly re-phrasing a line until it does what I want in the repl, and then naming it, and then moving on. Most often I end up with some enormous one-liner that I then break down into functions
20.
by icen 3y ago
APL!
21.
by icen 3y ago
Another classic use case is that you can have expressions in the types of your function, for example this won't compile: stringOrInt : (x : boolean) -> int -> (if x then String else int) stringOrInt true x = toString x
22.
by icen 3y ago
Do you have any examples that come to mind of it being slow? My experience has been that I've been the slowest part of my code, by a long way. Some optimisations aren't quite there (like under on higher rank arrays not being as fa
23.
by icen 3y ago
All APL versions have had variable assignments, denoted by ←, e.g. `var ← 1 2 3`. There is a concept of tacit, or point-free, programming, which avoids the variable names as parameters, for example the calculation of the mean `avg ← +⌿÷≢`.
24.
by icen 3y ago
I think if you're looking at learning an array language in order to learn an array language, because of the oft-discussed change in perspective and technique, then I think BQN meets that very handily. BQN is, in my opinion, the most sl
25.
by icen 4y ago
You can download a copy of Dyalog for free, if availability is the issue. If it's licensing/a desire to use open-source software, perhaps taking a look at its close relatives of J, or BQN, would be reasonable? * Dyalog https:&#x2
26.
by icen 4y ago
Here[0] is the episode covering BQN. Marshall has since joined the panel for the podcast. https://www.arraycast.com/episodes/episode-07-marshall-lochb...
27.
by icen 4y ago
Since the reference implementation is in javascript, I think that the expectation is that it will run on all of the flying saucers. The other (and main) implementation is in C, so I think between the two you shouldn't worry about BQN c
28.
by icen 5y ago
My reading of the piece is that it ascribes to the Copenhagen interpretation an anti-realist perspective - that is, the theory is nothing other than the ability to predict the results of experiments. In this view, there is no wave-function
29.
by icen 5y ago
Linux has a built-in keyboard that's easy enough to configure in your DE or with an X keyboard toggle. Dyalog has some introductory documentation on how to set up the mappings. https://www.dyalog.com/apl-font-keyboard.h
30.
by icen 5y ago
The original description is misleading, yes. The distinguishing between arities is a consistent feature of all of these languages. I find fluency comes quickly to it. Edit: as for intuition between the two, this is sometimes not obvious, bu

More ›