A compiler for lazy ML

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A compiler for lazy ML

Full text

Pdf (626 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1984 ACM Symposium on LISP and functional programming table of contents

Austin, Texas, United States

Pages: 218 - 227

Year of Publication: 1984

ISBN:0-89791-142-3

Author

Lennart Augustsson

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 54, Citation Count: 36

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800055.802038 What is a DOI?

ABSTRACT

LML is a strongly typed, statically scoped functional Language with Lazy evaluation. It is compiled trough a number of program transformations which makes the code generation easier. Code is generated in two steps, first code for an abstract graph manipulation machine, the G-machine. From this code machine code is generated. Some benchmark tests are also presented.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	R. M. Burstall , D. B. MacQueen , D. T. Sannella, HOPE: An experimental applicative language, Proceedings of the 1980 ACM conference on LISP and functional programming, p.136-143, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802799]
	2	L. Cardelli, "ML under UNIX", Polymorphism: The ML/LCF/Hope Newsletter, Vol. 1 no. 3 (January 1984).
	3	J. Fairbairn, "Ponder and its Type System", Technical Report No. 31, University of Cambridge, Computer Laboratory (November 1982).
	4	M. Gordon, R. Milner, and C. Wadsworth, "Edinburgh LCF", Lecture Notes in Computer Science, Vol. 78, Springer Verlag (1979).
	5	Paul Hudak , David Kranz, A combinator-based compiler for a functional language, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.122-132, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800523]
	6	R. J. M. Hughes, Super-combinators a new implementation method for applicative languages, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.1-10, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802129]
	7	Thomas Johnsson, Efficient compilation of lazy evaluation, Proceedings of the 1984 SIGPLAN symposium on Compiler construction, p.58-69, June 17-22, 1984, Montreal, Canada
	8	Neil D. Jones , Steven S. Muchnick, A fixed-program machine for combinator expression evaluation, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.11-20, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802130]
	9	R.Milner, "A Theory of Type Polymorphism in Programming", Journal of Computer and System Sciences, Vol. 17 no. 3 pp. 348-375 (1978).
	10	R. Milner, "Standard ML Proposal", Polymorphism: The ML/LCF/Hope Newsletter, Vol. 1 no. 3 (January 1984).
	11	Alan Mycroft, The Theory and Practice of Transforming Call-by-need into Call-by-value, Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming, p.269-281, April 22-24, 1980
	12	D. A. Turner, "New Implementation Techniques for Applicative Languages", Software - Practice and Experience, Vol. 9 pp. 31-49 (1979).

CITED BY 36

	Kenneth R. Traub, Compilation as partitioning: a new approach to compiling non-strict functional languages, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.75-88, September 11-13, 1989, Imperial College, London, United Kingdom
	Lennart Augustsson , Thomas Johnsson, Parallel graph reduction with the (v , G)-machine, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.202-213, September 11-13, 1989, Imperial College, London, United Kingdom
	R. C. Sekar , Prateek Mishra , I. V. Ramakrishnan, On the power and limitation of strictness analysis based on abstract interpretation, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.37-48, January 21-23, 1991, Orlando, Florida, United States
	P. Wadler, Views: a way for pattern matching to cohabit with data abstraction, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.307-313, January 21-23, 1987, Munich, West Germany
	William D. Clinger , Lars Thomas Hansen, Lambda, the ultimate label or a simple optimizing compiler for Scheme, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.128-139, July-Sept. 1994
	Henrik Nilsson, Tracing piece by piece: affordable debugging for lazy functional languages, ACM SIGPLAN Notices, v.34 n.9, p.36-47, Sept. 1999
	Mark Scheevel, NORMA: a graph reduction processor, Proceedings of the 1986 ACM conference on LISP and functional programming, p.212-219, August 1986, Cambridge, Massachusetts, United States
	David R. Lester, Stacklessness: compiling recursion for a distributed architecture, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.116-128, September 11-13, 1989, Imperial College, London, United Kingdom
	R. Sekar , I. V. Ramakrishnan, Fast strictness analysis based on demand propagation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.6, p.896-937, Nov. 1995
	Andrew Dwelly, Functions and dynamic user interfaces, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.371-381, September 11-13, 1989, Imperial College, London, United Kingdom
	Thérèse Hardin , Luc Maranget , Bruno Pagano, Functional back-ends within the lambda-sigma calculus, ACM SIGPLAN Notices, v.31 n.6, p.25-33, June 15, 1996
	Paul A. Steckler , Mitchell Wand, Lightweight closure conversion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.1, p.48-86, Jan. 1997
	R. C. Sekar , Shaunak Pawagi , I. V. Ramarkrishnan, Small domains spell fast strictness analysis, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.169-183, December 1989, San Francisco, California, United States
	Peter Buneman , Atsushi Ohori, Polymorphism and type inference in database programming, ACM Transactions on Database Systems (TODS), v.21 n.1, p.30-76, March 1996
	Nadia Nedjah , Luiza de Macedo Mourelle, Efficient concise deterministic pattern-matching automata for ambiguous patterns, ACM SIGPLAN Notices, v.37 n.2, February 2002
	P. J. Koopman, Jr. , P. Lee, A fresh look at combinator graph reduction, ACM SIGPLAN Notices, v.24 n.7, p.110-119, July 1989
	John Field, On laziness and optimality in lambda interpreters: tools for specification and analysis, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-15, December 1989, San Francisco, California, United States
	Philip J. Koopman, Jr. , Peter Lee , Daniel P. Siewiorek, Cache behavior of combinator graph reduction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.14 n.2, p.265-297, April 1992
	Niklas Röjemo , Colin Runciman, Lag, drag, void and use—heap profiling and space-efficient compilation revisited, ACM SIGPLAN Notices, v.31 n.6, p.34-41, June 15, 1996
	S. S. Thakkar , W. E. Hostmann, An instruction fetch unit for a graph reduction machine, ACM SIGARCH Computer Architecture News, v.14 n.2, p.82-91, June 1986
	Benjamin Goldberg, Buckwheat: graph reduction on a shared-memory multiprocessor, Proceedings of the 1988 ACM conference on LISP and functional programming, p.40-51, July 25-27, 1988, Snowbird, Utah, United States
	Atsushi Ohori, A simple semantics for ML polymorphism, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.281-292, September 11-13, 1989, Imperial College, London, United Kingdom
	Peter Sestoft, Demonstrating lambda calculus reduction, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Thomas Johnsson, Efficient compilation of lazy evaluation, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Annika Aasa , Kent Petersson , Dan Synek, Concrete syntax for data objects in functional languages, Proceedings of the 1988 ACM conference on LISP and functional programming, p.96-105, July 25-27, 1988, Snowbird, Utah, United States
	Paul Hudak, Conception, evolution, and application of functional programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.359-411, Sep. 1989
	R. Sekar , I. V. Ramakrishnan , P. Mishra, On the power and limitations of strictness analysis, Journal of the ACM (JACM), v.44 n.3, p.505-525, May 1997
	Paul Hudak , John Hughes , Simon Peyton Jones , Philip Wadler, A history of Haskell: being lazy with class, Proceedings of the third ACM SIGPLAN conference on History of programming languages, p.12-1-12-55, June 09-10, 2007, San Diego, California
	Alexandra Poulovassilis , Carol Small, Algebraic query optimisation for database programming languages, The VLDB Journal — The International Journal on Very Large Data Bases, v.5 n.2, p.119-132, April 1996
	Daniel J. Dougherty , Pierre Lescanne , Luigi Liquori, Addressed term rewriting systems: application to a typed object calculus, Mathematical Structures in Computer Science, v.16 n.4, p.667-709, August 2006
	P Wadler, A critique of Abelson and Sussman or why calculating is better than scheming, ACM SIGPLAN Notices, v.22 n.3, p.83-94, March 1987
	Claus Aßmann, A RISC processor architecture with a versatile stack system, ACM SIGARCH Computer Architecture News, v.21 n.5, p.63-70, Dec. 1993
	Thérèse Hardin , Luc Maranget , Bruno Pagano, Functional runtime systems within the lambda-sigma calculus, Journal of Functional Programming, v.8 n.2, p.131-176, March 1998
	Henrik Nilsson, How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger, Journal of Functional Programming, v.11 n.6, p.629-671, November 2001
	Owen Kaser , C. R. Ramakrishnan , I. V. Ramakrishnan , R. C. Sekar, EQUALS – a fast parallel implementation of a lazy language, Journal of Functional Programming, v.7 n.2, p.183-217, March 1997
	Peter Sestoft, Deriving a lazy abstract machine, Journal of Functional Programming, v.7 n.3, p.231-264, May 1997