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 BCKW. I'm either feeding google with > wrong question or there is no link available now...
13 years ago (ugh...) I've posted a tutorial-style treatment of the compilation of Dave Turner's SASL to SKI. Also addresses reduction and simple optimizations of the resulting SKI programs. http://www-db.informatik.uni-tuebingen.de/files/publications/sasl.ps.gz Cheers, —Torsten _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
