Compiling the polymorphic &lgr;-calculus

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Compiling the polymorphic &lgr;-calculus

Full text

Pdf (944 KB)

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: 285 - 296

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Authors

Spiro Michaylov	School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Frank Pfenning	School of Computer Science, Carnegie Mellon University, Pittsburgh, PA

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: 0

Additional Information:

references 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.115896 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	Val Breazu-Tannen. Combining algebra and higher-order types. In Third Annual Symposzum on Logic zn Computer Science, Edinburgh, Scotland, pages 82-90. IEEE, July 1988.
	2	Val Breazu-Tannen , Jean Gallier, Polymorphic rewriting conserves algebraic strong normalization, Selected papers of the 16th international colloquium on Automata, languages, and programming, p.3-28, June 1991, Stresa, Italy
	3	Corrado BShm and Alessandro Berarducci. Automatic synthesis of typed A-programs on term algebras. Theoretical Computer Science, 39:135- 154, 1985.
	4	R. Burstall , B. Lampson, A kernel language for abstract data types and modules., Proc. of the international symposium on Semantics of data types, p.1-50, July 1984, Sophia-Antipolis, France
	5	Luca Cardelli. Typeful programming. Research Report 45, Digital Equipment Corporation, Systems Research Center, Palo Alto, California, February 1989.
	6	T. Coquand , C. Paulin, Inductively defined types, Proceedings of the international conference on Computer logic, p.50-66, March 1990, Tallinn, USSR
	7	James Donahue , Alan Demers, Data types are values, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.3, p.426-445, July 1985 [doi>10.1145/3916.3987]
	8	Jon Fairbairn. Design and Implementation of a Simple Typed Language Based on the Lambda- Calculus. PhD thesis, University of Cambridge, May 1985.
	9	Jean H. Gallier. On Girard's "Candidats de R(Muctibilit(?'. In P. Odifreddi, editor, Logzc and Computer Science. Academic Press, 1990.
	10	J. W. O'Toole, Jr. , D. K. Gifford, Type reconstruction with first-class polymorphic values, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.207-217, June 19-23, 1989, Portland, Oregon, United States
	11	Peter Lee, Mark Leone, Spiro Michaylov, and Frank Pfenning. Towards a practical programming language based on the polymorphic lambda calculus. Ergo Report 89-085, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, November 1989.
	12	Spiro Michaylov and Frank Pfenning. Compiling the polymorphic h-calculus. Ergo Report 89-088, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, November 1989.
	13	Gopalan Nadathur and Dale Miller. An overview of )~Prolog. in Robert A. Kowalski and Kenneth A. Bowen, editors, Logzc Programming: Proceedzngs of the Fifth Internatzonal Conference and Symposzum, Volume 1, pages 810-827, Cambridge, Massachusetts, August 1988. MIT Press.
	14	Michel Parigot, On the representation of data in lambda-calculus, Proceedings of the third workshop on Computer science logic, p.309-321, July 1990, Kaiserslautern, Germany
	15	Christine Paulin-Mohring. Extraction de programmes dans le Calcul des Conslructzons. PhD thesis, Universit~ Paris VII, January 1989.
	16	J C Reynolds, Three approaches to type structure, Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85), p.97-138, April 1985, Berlin, Germany
	17	Philip Wadler, Theorems for free!, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.347-359, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99404]