I built a fun game [0] that shows the power of SKI calculus. Similar to infinite craft [1], you start with a base of elements (S and K combinators) and build your way up to any lambda term!
2,373 karma · joined July 22, 2023
I don't have a strong opinion about it myself, but the security aspect of OpenBSD is not as obvious as some people make it out to be.
Note that the grey pixels can actually carry a state that their children can derive from. Some children may then turn black/white depending on their state. So in theory lambda screen can show any fractal, not only IFS.
I'm currently exploring another approach to a massively parallel reducer for pure lambda calculus. Efficient sharing of lambda graphs is one of the main problems for me.
Balanced ternary was chosen as the default base because an investigation by Torben Mogensen[1] showed that it's a good compromise in terms of space and time complexity. Higher bases can be even more compact and efficient, but require much larger implementations for arithmetic operations. Balanced ternary also supports negative numbers, which unary (Church) or binary (Mogensen) don't.
Wouldn't the binary lambda calculus (BLC) encoding also suffice as a (relatively) compact map to these functions? To convert the encoding to a bigint, you'd just need to prepend a 1 and convert the binary string to decimal as normal.
I think I like the wing for the phoenix combinator actually. What other combinator could the goose be matched with? Hmm...
Other than that the combinators that I would have liked to match are vireo, warbler, thrush, lark, jay, hummingbird, (gold-)finch and becard - all of these don't have emojis.