Description
TILC aims to be a friendly visual
tool for teaching/studying main basic pure untyped lambdacalculus
concepts:
 Lambdaterm structure
 Notation
 Variable occurrences
nature
 Lambdabinder scope
 Betaredexes identification
 Lambdacalculus operational
semantics
 Betareduction on demand
 Normal Order
Reduction Strategies
 Untyped
LambdaCalculus as a programming language
 Bools,
naturals, fixedpoint combinators ...
The keypoint is that it deals with a graphical
presentation of the parsetree of lambdaterms.
It is written in Haskell and wxHaskell and
you can freely download it (oops, source code coming soon).
