Trying to learn languages more deeply.
This is a beta reducer for λ-expressions. Right now it only works if you put a million parantheses. Enjoy :>
- 'a'...'z'
- 'q' is taken for quitting the program
- '.'
- '(' & ')'
x(\x.M)(MM)
Use MOD_QUIT, MOD_INTERNALS and MOD_UPPER to tweak output behaviour.
- Interpretting things onto the stack.
- A cool feature right now is conditional jumps. Use
checkpoint, thenjbifto consume a boolean from the top of the stack.