Bootstrapping higher-order program transformers from interpreters

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Bootstrapping higher-order program transformers from interpreters

Full text

Pdf (770 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1996 ACM symposium on Applied Computing table of contents

Philadelphia, Pennsylvania, United States

Pages: 408 - 413

Year of Publication: 1996

ISBN:0-89791-820-7

Authors

Michael Sperber	Wilhelm-Schickard-Institut, Universität Tübingen, Sand 13, 72076 Tübingen, Germany
Robert Glück	DIKU, Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark
Peter Thiemann	Wilhelm-Schickard-Institut, Universität Tübingen, Sand 13, 72076 Tübingen, Germany

Sponsors

SIGBIO: ACM Special Interest Group on Biomedical Computing
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGICE: ACM Special Interest Group on Individual Computing Environment
SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 3, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/331119.331417 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	Andrew W. Appel, Compiling with continuations, Cambridge University Press, New York, NY, 1992
	2	A. W. Appel , T. Jim, Continuation-passing, closure-passing style, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.293-302, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75303]
	3	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
	4	BONDORF, A. $imiUx 5.0 Manual. DIKU, University of Copenhagen, May 1993.
	5	Anders Bondorf , Olivier Danvy, Automatic autoprojection of recursive equations with global variable and abstract data types, Science of Computer Programming, v.16 n.2, p.151-195, Sept. 1991 [doi>10.1016/0167-6423(91)90002-F ]
	6	BONDORF, A., AND JORCENS~N, J. Efficient analyses for realistic off-line partial evaluation. Journal of Func~nal Programming $, 3 (July 1995), $1~.
	7	CHIN, W.-N. Fully lazy higher-order removal. In Workshop Partial Evaluation and Semantics.Based Program Manipulation '92 (San Francisco, CA, June 1992), C. Consel, Ed., Yale University, pp. 38-47. Report YALEU / DCS / RR-909.
	8	CHIN, W.-N., AND DARLINGTON, J. Higher-order removaltransformation technique for functional programs. In Proc. of 15th Australian Computer Science Conference (Hobart, Tasmania, Jan. 1992), pp. 181-194. Australian CS Comm Vo114, No 1.
	9	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
	10	Charles Consel, Binding time analysis for high order untyped functional languages, Proceedings of the 1990 ACM conference on LISP and functional programming, p.264-272, June 27-29, 1990, Nice, France [doi>10.1145/91556.91668]
	11	CONS~L, C. A tour of Schism. In PEPM1993 {27}, pp. 134-154.
	12	Charles Consel , Olivier Danvy, Static and dynamic semantics processing, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.14-24, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99588]
	13	Daniel P. Friedman , Christopher T. Haynes , Mitchell Wand, Essentials of programming languages, MIT Press, Cambridge, MA, 1992
	14	FUTAMURA, Y. Partial evaluation of computation process---an approach to a compiler-compiler. Systems, Computers, Controls 2, 5 (1971), 45-50.
	15	Yoshihiko Futamura , Kenroku Nogi , Akihiko Takano, Essence of generalized partial computation, Theoretical Computer Science, v.90 n.1, p.61-79, Nov. 1991 [doi>10.1016/0304-3975(91)90299-H ]
	16	GLOCK, R. On the generation of specializers. Journal of Functional Programming 4, 4 (Oct. 1994), 499-514.
	17	GLOCK, R., AND jORGENSEN, J. Generating optimizing specializers. In IEEE International Conference on Computer Languages (1994), IEEE Computer Society Press, pp. 183- 194.
	18	Robert Glück , Andrei V. Klimov, Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree, Proceedings of the Third International Workshop on Static Analysis, p.112-123, September 22-24, 1993
	19	GLOCK, R., AND JORGENSEN, j. Generating transformers for deforestation and supercompilation. In Static Analysis (1994), B. Le Charlier, Ed., vol. 864 of Lecture Notes in Computer Science, Springer-Verlag, pp. 432-448.
	20	iEEE. Standard for the Scheme programming language. Tech. Rep. 1178-1990, Institute of Electrical and Electronic Engineers, Inc., New York, 1991.
	21	Neil D. Jones , Carsten K. Gomard , Peter Sestoft, Partial evaluation and automatic program generation, Prentice-Hall, Inc., Upper Saddle River, NJ, 1993
	22	JORGENSEN, J. Compiler generation by partial evaluation. Master's thesis, DIKU, University of Copenhagen, 1991.
	23	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 [doi>10.1145/143165.143220]
	24	John Launchbury, Projection factorisations in partial evaluation, Cambridge University Press, New York, NY, 1991
	25	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]
	26	Torben Æ. Mogensen, Self-applicable online partial evaluation of the pure lambda calculus, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.39-44, June 21-23, 1995, La Jolla, California, United States [doi>10.1145/215465.215469]
	27	Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, August 1993
	28	John C. Reynolds, Definitional interpreters for higher-order programming languages, Proceedings of the ACM annual conference, p.717-740, August 01-01, 1972, Boston, Massachusetts, United States [doi>10.1145/800194.805852]
	29	ROMANI3NKO, $. A. A compiler generator produced by a self-applicable specializer can have a surprisingly natural and understandable structure. In Partial Evaluation and Mixed Computation (1987), D. Bjomer, A. E Ershov, and N. D. Jones, Eds., North-Holland, pp. 445-464. Proceedings of the iFIP TC2 Workshop on Partial Evaluation and Mixed Computation.
	30	Erik Steven Ruf, Topics in online partial evaluation, Stanford University, Stanford, CA, 1993
	31	$CHERLIS, W., Ed. ACM $1GPLAbl Syrup. Partial Evaluation and Semantics.Based Program Manipulation '95 (La Jolla, CA, June 1995), ACM Press.
	32	THIEMANN, E, AND GLOCI<, R. The generation of a higher-order online partial evaluator. In Fuji Workshop on Functional and Logic Programming (Fuji $usono, Japan, july 1995), M. Takeichi, Ed., World Scientific Press, Singapore.
	33	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]
	34	TURCHIN, V. F. Program tranformation with metasystern transitions. Journal of Funct~nal Programming 3, 3 (July 1993), 283--313.
	35	Daniel Weise , Roland Conybeare , Erik Ruf , Scott Seligman, Automatic online partial evaluation, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.165-191, June 1991, Cambridge, Massachusetts, United States

CITED BY 3

	Robert Glück, Jones optimality, binding-time improvements, and the strength of program specializers, Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation, p.9-19, September 12-14, 2002, Aizu, Japan
	Neil D. Jones, Transformation by interpreter specialisation, Science of Computer Programming, v.52 n.1-3, p.307-339, August 2004
	Niels H. Christensen , Robert Glück, Offline partial evaluation can be as accurate as online partial evaluation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.1, p.191-220, January 2004