TILC aims to be a friendly visual
tool for teaching/studying main basic pure untyped lambda-calculus
- Lambda-term structure
- Variable occurrences
- Lambda-binder scope
- Beta-redexes identification
- Lambda-calculus operational
- Beta-reduction on demand
- Normal Order
Lambda-Calculus as a programming language
naturals, fixed-point combinators ...
The keypoint is that it deals with a graphical
presentation of the parse-tree of lambda-terms.
It is written in Haskell and wxHaskell and
you can freely download it (oops, source code coming soon).