How to choose a language, a lambda term (λx.y)((λx.xxx)(λx.xxx)) actually calculated? In other words, need a language to the normal order reduction and the weak type system.
Asked
Active
Viewed 272 times
1 Answers
2
What have you search for and what have you found so far?
I'd say there is no standard language that meets this requirement, since in most languages you always have different types, not just untyped terms. You probably need a pure lambda calculus interpreter (implementing one is a good exercise).
Petr
- 62,528
- 13
- 153
- 317
-
Oh, thank you very much! This is a simple idea - "A lambda calculus interpreter" For example, [this](http://lci.sourceforge.net) – ramntry Nov 10 '12 at 14:59