Partial evaluation is fuller laziness

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Partial evaluation is fuller laziness

Full text

Pdf (1.21 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

New Haven, Connecticut, United States

Pages: 223 - 233

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Authors

Carsten Kehler Holst	Department of Computing Science, University of Glasgow
Darsten Krogh Gomard	DIKU, Department of Computer Science, University of Copenhagen

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 11, Citation Count: 12

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/115865.115890 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.

	1	A. Bondorf, Automatic autoprojection of higher order recursive equations, Proceedings of the third European symposium on programming on ESOP '90, p.70-87, May 1990, Copenhagen, Denmark
	2	C. Consel. Analyse de Programmes, Evaluation Par. tielle, et Ggngration de Compilateurs. PhD thesis, Universit6 Paris VI, 1989. (in French).
	3	Charles Consel , Olivier Danvy, Partial evaluation of pattern matching in strings, Information Processing Letters, v.30 n.2, p.79-86, January 1989 [doi>10.1016/0020-0190(89)90113-0]
	4	Charles Consel, New Insights into Partial Evaluation: the SCHISM Experiment, Proceedings of the 2nd European Symposium on Programming, p.236-246, March 21-24, 1988
	5	Charles Consel , Olivier Danvy, Partial evaluation of pattern matching in strings, Information Processing Letters, v.30 n.2, p.79-86, January 1989 [doi>10.1016/0020-0190(89)90113-0]
	6	C. K. Gomard. Higher Order Partial Evaluation - HOPE for the Lambda Calculus. Master's thesis, DIKU, University of Copenhagen, Denmark, September 1989.
	7	C. K. Gomard and N. D. Jones. Compiler generation by partial evaluation. In G. X. Ritter, editor, Information Processing '89. Proceedings of the IFIP 11th World Computer Congress, pages 1139-1144, IFIP, North- Holland, 1989.
	8	T. A. Hansen and J. L. Tr~ff. Memoization and its Use in Lazy and Incremental Program Generation. Master's thesis, DIKU, University of Copenhagen, 1989.
	9	Carsten Kehler Hoist. Improving full laziness. In Simon L. Peyton Jones, Graham Hutton, and Carsten Kehler Holst, editors, Functional Programming, Springer-Verlag, Ullapool, Scotland, 1991.
	10	Carsten Kehler Holst and John Hughes. Towards improving binding time for free! In Simon L. Peyton Jones, Graham Hutton, and Carsten Kehler Holst, editors, Functional Programming, Springer-Verlag, U1- lapooI, Scotland, 1991.
	11	N.C.K. Holst. Language triplets: the AMIX approach. In D. Bjorncr, A.P. Ershov, and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 167- 185, North-Holland, 1988.
	12	Paul Hudak and Philip Wadler (editors). Report on the programming language Haskell. Tecnical Report, Yale University and Glasgow University, April 1990.
	13	R. John M. Hughes. The Design and Implementation of Programming Languages. PhD thesis, Oxford, 1984.
	14	R. John M. Hughes. Lazy memo-functions. January 1985. Programming Methodology Group Memo PGM- 42.
	15	N.D. Jones, C.K. Gomard, A. Bondorf, O. Danvy, and T./E. Mogensen. A self-applicable partial evaluator for the lambda calculus. In 1990 International Confer. ence on Computer Languages, New Orleans, Louisiana, March 1990, pages 49-58, IEEE Computer Society, 1990.
	16	Neil D. Jones , Peter Sestoft , Harald Sondergaard, An experiment in partial evaluation: the generation of a compiler generator, Proc. of the first international conference on Rewriting techniques and applications, p.124-140, December 1985, Dijon, France
	17	N.D. Jones, P. Sestoft, and H. Sendergaard. Mix: a selfapplicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9-50, 1989.
	18	Jesper Jergensen. Generating a pattern matching compiler by partial evaluation. In Simon L. Peyton Jones, Graham Hutton, and Carsten Kehler Hoist, editors, Functional Programming, Springer-Verlag, U1- lapool, Scotland, 1991.
	19	Donald E. Knuth, James H. Morris, and Vaughan R. Pratt. Fast pattern matching in strings. SIAM Journal of Computation, 6(2):323-350, 1977.
	20	T. Mogensen. The Application of Partial Evaluation to Ray-Tracing. Master's thesis, DIKU, University of Copenhagen, Denmark, 1986.
	21	T. Mogensen. Partially static structures in a selfapplicable partial evaluator. In D. Bjorner, A.P. Ershoe, and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 325-347, North-Holland, 1988.
	22	Torben Æ Mogensen, Separating binding times in language specifications, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.12-25, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99372]
	23	H. Riis Nielson , F. Nielson, Eureka definitions for free! or disagreement points for fold/unfold transformations, Proceedings of the third European symposium on programming on ESOP '90, p.291-305, May 1990, Copenhagen, Denmark
	24	Simon L. Peyton Jones and David Lester. A Modular Fully-Lazy Lambda Lifter in Haskell. CS Report CSC 90/R17, Department of Computing Science, University of Glasgow, June 1990.
	25	S.A. Romanenko. A compiler generator produced by a self-applicable specializer can have a surprisingly natural and understandable structure. In D. Bje~rner, A.P. Ershov, and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 445-463, North- Holland, 1988.
	26	Valentin F. Turchin, The concept of a supercompiler, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.3, p.292-325, July 1986 [doi>10.1145/5956.5957]
	27	Philip Wadler, Deforestation: transforming programs to eliminate trees, Proceedings of the Second European Symposium on Programming, p.231-248, January 1988, Nancy, France

CITED BY 12

	Jesper Jørgensen, Generating a compiler for a lazy language by partial evaluation, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.258-268, January 19-22, 1992, Albuquerque, New Mexico, United States
	Anders Bondorf, Improving binding times without explicit CPS-conversion, ACM SIGPLAN Lisp Pointers, v.V n.1, p.1-10, Jan. 1992
	Bernd Grobauer , Julia L. Lawall, Partial evaluation of pattern matching in strings, revisited, Nordic Journal of Computing, v.8 n.4, p.437-462, December 2001
	François-Régis Sinot, Complete Laziness: a Natural Semantics, Electronic Notes in Theoretical Computer Science (ENTCS), 204, p.129-145, April, 2008
	Daniel Damian , Olivier Danvy, Syntactic accidents in program analysis: on the impact of the CPS transformation, ACM SIGPLAN Notices, v.35 n.9, p.209-220, Sept. 2000
	Mads Sig Ager , Olivier Danvy , Henning Korsholm Rohde, Fast partial evaluation of pattern matching in strings, ACM SIGPLAN Notices, v.38 n.10, p.3-9, October 2003
	Daniel Damian , Olivier Danvy, Syntactic accidents in program analysis: on the impact of the CPS transformation, Journal of Functional Programming, v.13 n.5, p.867-904, September 2003
	Michael Sperber , Peter Thiemann, Generation of LR parsers by partial evaluation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.2, p.224-264, March 2000
	Julia L. Lawall , Olivier Danvy, Continuation-based partial evaluation, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.227-238, July-Sept. 1994
	Kedar Swadi , Walid Taha , Oleg Kiselyov , Emir Pasalic, A monadic approach for avoiding code duplication when staging memoized functions, Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 09-10, 2006, Charleston, South Carolina
	Mads Sig Ager , Olivier Danvy , Henning Korsholm Rohde, Fast partial evaluation of pattern matching in strings, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.4, p.696-714, July 2006
	John Hatcliff , Olivier Danvy, A computational formalization for partial evaluation, Mathematical Structures in Computer Science, v.7 n.5, p.507-541, October 1997