Using types to avoid redundant specialization

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Using types to avoid redundant specialization

Full text

Pdf (1.52 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: 321 - 333

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Authors

Erik Ruf	Computer Systems Laboratory, Stanford University, Stanford, CA
Daniel Weise	Computer Systems Laboratory, Stanford University, Stanford, CA

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

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.115902 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 and O. Danvy. Automatic autoprojection for recursive equations with global variables and abstract data types. DIKU Report 90/04, University of Copenhagen, Copenhagen, Denmark, 1990.
	2	M. A. Bulyonkov. Polyvariant mixed computation for analyzer programs. Acta Informatica, 21:473- 484, 1984.
	3	R. M. Burstall , John Darlington, A Transformation System for Developing Recursive Programs, Journal of the ACM (JACM), v.24 n.1, p.44-67, Jan. 1977 [doi>10.1145/321992.321996]
	4	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]
	5	Gerald Dejong , Raymond Mooney, Explanation-Based Learning: An Alternative View, Machine Learning, v.1 n.2, p.145-176, 1986 [doi>10.1023/A:1022898111663]
	6	Y. Futamura and K. Nogi. Generalized partial computation. In D. Bjerner, A. Ershov, and N. Jones, editors, Partial Evaluation and Mixed Computation, pages 133-151. North-Holland, 1988.
	7	Carlo Ghezzi , Dino Mandrioli , Antonio Tecchio, Program Simplification via Symbolic Interpretation, Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science, p.116-128, December 16-18, 1985
	8	A. ttaraldsson. A Program Manipulation System Based on Partial Evaluation. PhD thesis, LinkSping University, 1977. Published as Link5ping Studies in Science and Technology Dissertation No. 14.
	9	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
	10	K. M. Kahn. A partial evaluator of Lisp programs written in Prolog. In M. V. Caneghem, editor, First International Logic Programming Conference, pages 19-25, Marseille, France, 1982.
	11	J. Launchbury. Projection Faetorisations in Partial Evaluation. PhD thesis, University of Glasgow, 1991. Published as CS Report CS(' 90/R2.
	12	David MacQueen , Gordon Plotkin , Ravi Sethi, An ideal model for recursive polymorphic types, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.165-174, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800528]
	13	Tom M. Mitchell , Richard M. Keller , Smadar T. Kedar-Cabelli, Explanation-Based Generalization: A Unifying View, Machine Learning, v.1 n.1, p.47-80 [doi>10.1023/A:1022691120807]
	14	T. Mogensen. Partially static structures, in D. Bjerner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 325-347. North-Holland, 1988.
	15	T. Mogensen. Binding Time Aspecls of Partial Evaluatzon. PhD thesis, DIKU, University of Copenhangen, Copenhagen, Denmark, March 1989.
	16	J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
	17	R. Schooler, PARTIAL EVALUATION AS A MEANS OF LANGUAGE EXTENSIBILITY, Massachusetts Institute of Technology, Cambridge, MA, 1984
	18	V. Turchin. The algorithmn of generalization in the supercompiler, in D. Bjerner, A. P. Ershov, and N. D. jones, editors, Partial Evaluation and Mixed Computation, pages 531-549. North-Holland, 1988.
	19	F. Van Harmelen , A. Bundy, Explanation-based generalisation = partial evaluation, Artificial Intelligence, v.36 n.3, p.401-412, October 1988 [doi>10.1016/0004-3702(88)90088-4]
	20	D. Weise. Graphs as an intermediate representation for partial evaluation. Technical Report CSL- TR-90-421, Computer Systems Laboratory, Stanford University, Stanford, CA, 1990.
	21	Daniel Weise , Erik Ruf, Computing Types During Program Specialization, Stanford University, Stanford, CA, 1990
	22	J. Young and P. O'Keefe. Experience with a type evaluator. In D. Bjerner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 573-581. North-Holland, 1988.

CITED BY 11

	Pieter Spronck , Klaas Schilstra, BOKS: A Rule-Based System in Support of the Dutch Building Materials Regulations, Revised Papers from the PRICAI 2000 Workshop Reader, Four Workshops held at PRICAI 2000 on Advances in Artificial Intelligence, p.93-102, August 28-September 01, 2000
	Dirk Dussart , Eddy Bevers , Karel De Vlaminck, Polyvariant constructor specialisation, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.54-65, June 21-23, 1995, La Jolla, California, United States
	Frank Vahid, Partitioning sequential programs for CAD using a three-step approach, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.7 n.3, p.413-429, July 2002
	Karoline Malmkjær, Towards efficient partial evaluation, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.33-43, June 14-16, 1993, Copenhagen, Denmark
	Karoline Malmkjær , Peter Ørbæk, Polyvariant specialisation for higher-order, block-structured languages, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.66-76, June 21-23, 1995, La Jolla, California, United States
	Jeffrey Dean , Craig Chambers, Towards better inlining decisions using inlining trials, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.273-282, July-Sept. 1994
	Brian R. Murphy , Monica S. Lam, Program analysis with partial transfer functions, ACM SIGPLAN Notices, v.34 n.11, p.94-103, Nov. 1999
	Frank Vahid, Procedure cloning: a transformation for improved system-level functional partitioning, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.4 n.1, p.70-96, Jan. 1999
	Jeffrey Dean , Craig Chambers , David Grove, Selective specialization for object-oriented languages, ACM SIGPLAN Notices, v.30 n.6, p.93-102, June 1995
	Brian R. Murphy , Monica S. Lam, Program analysis with partial transfer functions, ACM SIGPLAN Notices, v.34 n.11, p.94-103, Nov. 1999
	Charles Consel , Olivier Danvy, Tutorial notes on partial evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.493-501, March 1993, Charleston, South Carolina, United States