An edition of Compiling functional languages
(1988)
Compiling functional languages
by Antoni Diller
Share
×Close
How Turner's combinator-based graph-reducers can be used to implement functional programming languages.
Check nearby libraries
Buy this book
| Edition | Availability |
|---|---|
1
|
aaaa
|
2
|
zzzz
|
Book Details
Table of Contents
Contents
List of Figures
Preface
Acknowledgments
1. Introduction
2. Lispkit Lisp
3. Combinatory Logic
4. Translating Lispkit into Combinators
5. Graph-reduction
6. The Lambda Calculus
7. Bracket Abstraction Algorithms
8. Supercombinators
9. Pattern-matching
10. Categorical Combinators
11. Reduction and Transformation
12. Strictness Analysis
13. Type Systems
A. Simple Lispkit System
Glossary
Annotated Bibliography
Index
Edition Notes
Bibliography: p. 264-284.
Includes index.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
See All
| October 18, 2022 | Edited by ImportBot | import existing book |
| October 12, 2012 | Edited by 100.1.118.58 | added description |
| December 4, 2010 | Edited by Open Library Bot | Added subjects from MARC records. |
| April 28, 2010 | Edited by Open Library Bot | Linked existing covers to the work. |
| December 9, 2009 | Created by WorkBot | add works page |