|
- The Unlambda Programming Language - Madore
Writing Unlambda programs isn't really as hard as it might seem; however, reading Unlambda programs is practically impossible We'll be explaining what all this means later on, but let's just stick to basic observations for the moment
- Unlambda - Esolang
For reasoning about Unlambda programs, or for displaying partially evaluated expressions, it is useful to have a notation for ongoing computations and continuations
- GitHub - louiswins unlambda: unl is an Unlambda interpreter
This is a complete (modulo bugs) interpreter for Unlambda 2 It is pretty similar to the c-refcnt version included in the Unlambda distribution because I followed the implementation hints on the language's home page
- Unlambda (because I can!) - Using uLisp - uLisp Forum
I wanted to write a test case that really hammers uLisp’s tail-call elimination and closure code hard, so after scratching my head for a while I decided to write a Unlambda interpreter
- Unlambda
Unlambda is based on combinatory logic which was invented by Moses Schon-nkel 1924 and later revisited by Haskell Curry The combinatory logic operates with so called combinators and does not need any variables just as Unlambda
- Implementing Unlambda - Terbium
I recently implemented Relambda, a bytecode compiling Unlambda interpreter In this post, I review Unlambda, Bytecode compilation, and the tricks I used to make them work together
|
|
|