3 ms·
I've been working on a combinatoric approach with Fexl, "compiling" all the way down to my two turtles S and C, e.g.: http://fexl.com/blog/9 http://fexl.com/bl
by fexl 16y ago
I've been working on a combinatoric approach with Fexl, "compiling" all the way down to my two turtles S and C, e.g.:
http://fexl.com/blog/9 http://fexl.com/blog/9
I'm also relying on two higher-level combinators L and R to reduce the size of the combinatorial forms, e.g.:
http://fexl.com/blog/10 http://fexl.com/blog/10
The bottom line is that the entire Fexl parser is defined in terms of the two primitive combinators S and C.
- iam 16y agoI was confused a while till I saw you talking about Moses Schönfinkel. From everything I've seen people usually refer to those as SK combinators not SC combinators.
- fexl 16y agoRight, that's "K" as in "Konstanzfunktion" in the original German. The book "From Frege to Gödel" uses "C" as in "Constancy Function" in English, and I got in the habit of using that.