📖Exciting News! 📖 You can now read (for free!) a paper written by Aaron Hsu🎓Aaron W. Hsu and Rodrigo Girão Serrão for ARRAY 23 (in Orlando🌴this month.) Download "U-Net CNN in APL: Exploring Zero-Framework, Zero-Library Machine Learning" at dl.acm.org/doi/10.1145/35…

Default dictionaries: how they could be introduced to k with a minimum of changes, why they would be useful, and some hand-wringing over whether dicts are actually good. gist.github.com/chrispsn/ff018…

k code maps are fundamental. nsl.com/papers/m.txt

Advent of Code 2023! K leaderboard: 419401-2f52b175

How are primitive functions (such as 'count') like, or unlike, dictionaries? For example: - both can be indexed and inverse-indexed into - primitives have an infinite domain - primitive domain can be a general list - dictionary indexing is rank-sensitive

oantolin found a shorter way to write the k6 prime sieve discussed here - no raze or deep where! {x^/x*/:x}2+!100 gist.github.com/chrispsn/af684…

Flat ranges (f 3 2 => 0 1 2 0 1), same as ,/!': {(!+/x)-&(0 :':+\x)!x} Or if you have an occurrence count primitive: oc:{i-(i:<<x)x?x} oc@&: Reverse flat ranges (f 3 2 => 2 1 0 1 0), same as ,/|'!': {(&a!x)-1+!*|a:+\x}

Arthur Whitney has released an open-source k with the MIT license! See k.zip here: shakti.com/k

Excited to release a new version of Mesh Spreadsheet! github.com/chrispsn/mesh-…