Program bifurcation for a polymorphically typed functional language

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Program bifurcation for a polymorphically typed functional language

Full text

Pdf (1.09 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: 142 - 153

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Authors

Anne De Niel	Department of Computer Science, KU Leuven, Celestijnenlaan 200A, B-3001 Leuven, Belgium
Eddy Bevers	Department of Computer Science, KU Leuven, Celestijnenlaan 200A, B-3001 Leuven, Belgium
Karel De Vlaminck	Department of Computer Science, KU Leuven, 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): 1, Downloads (12 Months): 4, Citation Count: 3

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

	BEJ88	Bjorner, D., Ershov, A.P. and Jones, N.D. (eds.), Workshop on Partial Evaluation and Mixed Computation, GL Averrwns, Denmark, October 1987, North-HolJand, 1988.
	BJMS88	Bondorf, A., Jones, N. D., Mogensen, T. and Sestoft, P. Binding Time Analy.w and the Taming of Self-Application. Draft, DIKLT, University of Copenhagen, 1988.
	Fut71	Futamura, Y. Partial Evaluation of Computation Process - an App?oach to a Compiler-Compiler. Systems, Computers, Controls, vol. 2, m. 5, pp. 45-50, 1971.
	Jon88	Jones, N.D. Automatic P?og?am Specialization: A Re-examination from Basic Principles. In: {BEJ88}, pp. 225-282.
	JSS89	Jones, N. D., Sestoft, P. and SOndergaard, H. MIX: a Self-Applicable PaTtial EvahatoT foT Experiment in CompileT Generation. LISP and Symbolic Computation, 2, 1, pp. 9-50, 1989.
	Kle52	Kleene, S.C. Introduction to Metamathematics. Van Nostrand, 1952.
	Lau88	Launchbury, J. Projections for Specialization. In: {BEJ88}, pp. 299-315.
	Lau90	Launchbury, J. Projection FactoTisations in Partial Evaluation. Department of Computing Science, University of Glasgow, Report CSC 90/R2 (Ph.D. thesis), 1990.
	Mog88	Mogensen, T. Partially Static Structures in a Self-Applicable Pa?tial Evaluator. fn: {BEJ88}, pp. 325-347.
	Mog89a	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
	Mog89b	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]
	Rom90	S. A. Romanenko, Arity raiser and use in program specialization, Proceedings of the third European symposium on programming on ESOP '90, p.341-360, May 1990, Copenhagen, Denmark

CITED BY 3

	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
	Todd B. Knoblock , Erik Ruf, Data specialization, ACM SIGPLAN Notices, v.31 n.5, p.215-225, May 1996
	Yanhong A. Liu , Scott D. Stoller, Eliminating dead code on recursive data, Science of Computer Programming, v.47 n.2-3, p.221-242, May 2003