Hal Daume III <[EMAIL PROTECTED]> wrote:
> I'd be interested in seeing how you do this.  I attempted such a thing a
> while back but was unsuccessful.

Attached are two interpreters: one for untyped lambda calculus,
and one for an Unlambda-style language (combinators).

Of course pure lambda terms are not very useful Haskell types.
You may use your own types as primitive terms by defining
instances of Subst and/or Eval of them.


Do You Yahoo!?
Yahoo! Movies - coverage of the 74th Academy Awards®

Attachment: lambda.lhs
Description: lambda.lhs

Attachment: unlambda.lhs
Description: unlambda.lhs

Reply via email to