[Haskell-cafe] OT: Literature on translation of lambda calculus to combinators

Job Vranish jvranish at gmail.com
Thu Jan 28 11:48:23 EST 2010

> Why is it difficult?

Ideally we'd like the type of convert to be something like:
convert :: LambdaExpr -> SKIExpr
but this breaks in several places, such as the nested converts in the RHS of
the rule:
convert (Lambda x (Lambda y e)) | occursFree x e = convert (Lambda x
(convert (Lambda y e)))

A while ago I tried modifying the algorithm to be pure top-down so that it
wouldn't have this problem, but I didn't have much luck.

Anybody know of a way to fix this?

- Job

On Thu, Jan 28, 2010 at 10:21 AM, Felipe Lessa <felipe.lessa at gmail.com>wrote:

> On Thu, Jan 28, 2010 at 09:23:23AM -0500, Job Vranish wrote:
> > -- The anoying thing about the algorithm is that it is difficult to
> separate
> > the SKI and LC expression types
> > --  it's easiest to just combine them.
> Why is it difficult?
> --
> Felipe.
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20100128/10c4c3d7/attachment.html

More information about the Haskell-Cafe mailing list