Polyvariant constructor specialisation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Polyvariant constructor specialisation

Full text

Pdf (1.12 MB)

Source

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

La Jolla, California, United States

Pages: 54 - 65

Year of Publication: 1995

ISBN:0-89791-720-0

Authors

Dirk Dussart	Katholieke Universiteit Leuven, Departement Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
Eddy Bevers	Katholieke Universiteit Leuven, Departement Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
Karel De Vlaminck	Katholieke Universiteit Leuven, Departement Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

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

	CK91	Charles Consel , Siau Cheng Khoo, Parameterized partial evaluation, ACM SIGPLAN Notices, v.26 n.6, p.92-106, June 1991
	DNBDV91	A. De Niel, E. Bevers, and K. De Vlaminck. PartiM evaluation of polymorphicany typed furtctionM languages: The representation problem. In M. Billaud et al., edltors, Analyse Stati~ue en Programmation Equationnelle, Fonetionnelle, et Logique, Bordeaux, France, Octobre 1991 (Bigre, vol. 7~), pages 90-97. Rennes: IRISA, 1991.
	Har77	A. Haraldsson. A Program Manzpula.hon System Based on Partial Enaluation. PhD thesis, LinkSping University, Sweden, 1977. LinkJping Studies in Science and Technology Dissertations 14.
	Hen91	Fritz Henglein, Efficient type inference for higher-order binding-time analysis, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.448-472, June 1991, Cambridge, Massachusetts, United States
	HL91	C.K. Holst and J. Launchbury. Handwriting cogen to avoid problems with static typing. In Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, Skye, Scotland, pages 210-218. Glasgow University, 1991.
	JM86	Neil D. Jones , Alan Mycroft, Data flow analysis of applicative programs using minimal function graphs, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.296-306, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512672]
	JSS89	N.D. Jones, P. Sestoft, and H. Sendergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9-50, 1989.
	Lau91a	John Launchbury, Projection factorisations in partial evaluation, Cambridge University Press, New York, NY, 1991
	Lau91b	John Launchbury, A strongly-typed self-applicable partial evaluator, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.145-164, June 1991, Cambridge, Massachusetts, United States
	Mog89	Torben Æ. Mogensen, Binding Time Analysis for Polymorphically Typed Higher Order Languages, Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages, p.298-312, March 13-17, 1989
	Mog93	Torben Æ Mogensen, Constructor specialization, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.22-32, June 14-16, 1993, Copenhagen, Denmark [doi>10.1145/154630.154633]
	MR85	Prateek Mishra , Uday S. Reddy, Declaration-free type checking, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.7-21, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318603]
	Nie88	F. Nielaon. A formal type system for comparing partial evaluators. In D. Bj#rner, A.P. Ershov, and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 349-384. Amsterdam: North- Holland, 1988.
	RW91	Erik Ruf , Daniel Weise, Using types to avoid redundant specialization, ACM SIGPLAN Notices, v.26 n.9, p.321-333, Sept. 1991

CITED BY 5

	Dirk Dussart , John Hughes , Peter Thiemann, Type specialisation for imperative languages, ACM SIGPLAN Notices, v.32 n.8, p.204-216, Aug. 1997
	John Hughes, Type specialization, ACM Computing Surveys (CSUR), v.30 n.3es, Sept. 1998
	Charles Consel , Julia L. Lawall , Anne-Françoise Le Meur, A tour of tempo: a program specializer for the C language, Science of Computer Programming, v.52 n.1-3, p.341-370, August 2004
	Torben Mogensen, Inherited limits, ACM Computing Surveys (CSUR), v.30 n.3es, Sept. 1998
	Tim Sheard , Nathan Linger, Search-based binding time analysis using type-directed pruning, Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation, p.20-31, September 12-14, 2002, Aizu, Japan