This rewrite system is a working version of anharmonic lambda, or kali (older: kaleidoscope). The goal is to find a version which contains both chemlambda v2 and em-convex. All rewrites are chosen from emergent algebra considerations. See this tool to choose DIST rewrites. It is amazing that it can reduce lambda terms. It has also a brutal form of eta reduction, related to the Reidemester 2 moves. Work in progress because as the name tells, a completely symmetrical version should have 24 nodes.

Credits: I modified this js version by ishanpm of my chemlambda v2, see issue 9. The first 4 duplication examples are inspired from lambda terms proposed in issue 8.

Last modified: 18.10.2019. Part of (my pages to play and learn)

SKK omega from S,K combinators duplication with FOE of \x.((\y.yy)(xx)) duplication with FO of \x.((\y.yy)(xx)) duplication with FOE of \x.(\f.ff)(\y.xy) duplication with FO of \x.(\f.ff)(\y.xy) duplication of M, then applied to id, for M = \x.(\f.ff)(\y.xy) first (pair a b) where a and b come from FOE duplication of \x.(\f.ff)(\y.xy) first (pair a b) with pair = \x.\y.\z. z x y and first = \p.(p (\x.\y.x)), a = 5, b = 0 Y combinator applied to something Y combinator applied to id omega combinator ackermann_2_2 ackermann_3_2 the 10-nodes quine (sometimes it duplicates) 10 nodes sometimes becomes quine from [graph A-L-FI-FOE 540213] dodecahedron 5 X 5 = (\m.\n.\f.m(nf)) 5 5 5 X 5 = (\m.\n.m (PLUS n) 0) 5 5, with PLUS = \m.\n.m SUCC n     (stops at max. number of nodes 2048)