Dear all,
Dušan Kolář kolar at fit.vutbr.cz writes:
[...]
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
Job Vranish jvran...@gmail.com writes:
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
Cool, Thanks :D
also quickcheck says the two algorithms are equivalent :)
On Fri, Jan 29, 2010 at 4:33 AM, Nick Smallbone nick.smallb...@gmail.comwrote:
Job Vranish jvran...@gmail.com writes:
Ideally we'd like the type of convert to be something like:
convert :: LambdaExpr - SKIExpr
