Compiling Functional Languages

Describes different ways of implementing functional programming languages which bear a strong family resemblance to one another, and which all have their origins in the work of Turner on combinator-based graph-reducers. First chapters cover translation of Lipskit into combinatory logic, and evaluation of the resulting object code by graph-reduction. Later chapters follow a natural progression, refining and improving the efficiency of this implementation. Contents List of Figures Preface Acknowledgments Introduction Lispkit Lisp Combinatory Logic Translating Lispkit into Combinators Graph-reduction The Lambda Calculus Bracket Abstraction Algorithms Supercombinators Pattern-matching Categorical Combinators Reduction and Transformation Strictness Analysis Type Systems Simple Lispkit System Glossary Annotated Bibliography Index An attempt to describe a number of different ways of implementing functional programming languages which bear a strong family resemblance to one another and which all have their origins in the work of Turner on combinator-based graph-reducers. How Turner's combinator-based graph-reducers can be used to implement functional programming languages.