Highlights from nhc—a space-efficient Haskell compiler

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Highlights from nhc—a space-efficient Haskell compiler

Full text

Pdf (1.23 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the seventh international conference on Functional programming languages and computer architecture table of contents

La Jolla, California, United States

Pages: 282 - 292

Year of Publication: 1995

ISBN:0-89791-719-7

Author

Niklas Röjemo

Department of Computer Science, Chalmers University of Technology, S-412 96 Göteborg, Sweden

Sponsors

IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 18, Citation Count: 6

Additional Information:

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/224164.224217 What is a DOI?

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.

	AJ89	L. Augustsson , T. Johnsson, The Chalmers lazy ML-compiler, The Computer Journal, v.32 n.2, p.127-141, April 1989 [doi>10.1093/comjnl/32.2.127]
	Bir84	R. S. Bird. Using Circular Programs to Eliminate Multiple Traverals of Data. Acta Informat2ca, 21:239-250, 1984.
	Bur75	W. H. Burge. Recursive Programming Techniques. Addison-Wesley Publishing Company, Reading, Mass., 1975.
	Har95	Pieter H. Hartel et. al. Pseudoknot: a Float- Intensive Benchmark for Functional Compilers. submitted to journal of Functional Programming, 1995.
	Hut92	Graham Hutton. Higher-order functions for parsing. Journal of Functional Programming, 2:323- 343, 1992.
	Joh87	Thomas Johnsson, Attribute grammars as a functional programming paradigm, Proc. of a conference on Functional programming languages and computer architecture, p.154-173, October 1987, Portland, Oregon, United States
	Jon91	Mark P. Jones. Release notes for gofer 2.21. Technical report, Department of Computer Science, Yale University, November 1991. Included as part of the standard Gofer distribution.
	Jon94	Mark P. Jones. The implementation of gofer functional programming system. Technical report, Department of Computer Science, Yale University, 1994.
	Mil78	Robin Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and Systems Sciences, 17:348-375, 1978.
	Par94a	Will Paxtain. ghc-0.23.announce, December 1994. Included as part of the Glasgow Haskell Compiler distribution.
	Par94b	Will Partain. ghc-0.23.readme, December 1994. Included as part of the Glasgow Haskell Compiler distribution.
	PJ87	Simon L. Peyton Jones, The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science), Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	PW94	Andrew Partridge and David Wright. Parser combinators need four values to report errors. Technical report, Department of Computing Science, University of Tasmania, 1994.
	San94	Patrick M. Sansom. Execution profiling for nonstrict functional languages. PhD thesis, Department of Computing Science, University of Glasgow, 1994.
	Sed83	Robert Sedgewick, Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1984
	WB89	P. Wadler , S. Blott, How to make ad-hoc polymorphism less ad hoc, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.60-76, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75283]

CITED BY 6

	Malcolm Wallace , Colin Runciman, The bits between the lambdas: binary data in a lazy functional language, ACM SIGPLAN Notices, v.34 n.3, p.107-117, March 1999
	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
	Thomas Johnsson, Efficient compilation of lazy evaluation, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Jan-Willem Maessen, Eager Haskell: resource-bounded execution yields efficient iteration, Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, p.38-50, October 03, 2002, Pittsburgh, Pennsylvania
	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
	David Wakeling, The dynamic compilation of lazy functional programs, Journal of Functional Programming, v.8 n.1, p.61-81, January 1998