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

[Serguey Zefirov]

Also see http://www.haskell.org/haskellwiki/Super_combinator Wiki page.

Fixed set of combinators gives you complexity of translation that is
more than linear of the length of lambda expression.

The length of output string is O(3^length(lambdaExpression)) for SK
combinator pair.

2010/1/28 Dušan Kolář <kolar at fit.vutbr.cz>:
> Dear cafe,
>
>  Could anyone provide a link to some paper/book (electronic version of both
> preferred, even if not free) that describes an algorithm of translation of
> untyped lambda calculus expression to a set of combinators? Preferably SKI
> or BCKW. I'm either feeding google with wrong question or there is no link
> available now...
>
>  Thanks,
>
>    Dušan
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>