Compiling the polymorphic λ-calculus
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 and Jean Gallier. Polymorphic rewriting conserves algebraic strong normalization and confluence. In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Delia Rocca, editors, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, Stresa, Ilaly, pages 137-150. Springer-Verlag LNCS 372, July 1989.
[3]
Corrado BShm and Alessandro Berarducci. Automatic synthesis of typed A-programs on term algebras. Theoretical Computer Science, 39:135- 154, 1985.
[4]
Rod Burstall and Butler Lampson. A kernel language for abstract data types and modules. In G. Kahn, D. MacQueen, and G. Plotkin, editors, Semantics of Data Types, pages 1-50. Springer- Verlag, 1984.
[5]
Luca Cardelli. Typeful programming. Research Report 45, Digital Equipment Corporation, Systems Research Center, Palo Alto, California, February 1989.
[6]
Thierry Coquand and Christine Paulin. Inductively defined types. In P. Martin-LSf and G. Mints, editors, COLOG-88, pages 50-66. Springer-Verlag LNCS 417, December 1988.
[7]
James Donahue and Alan Demers. Data types are values. A CM Transactions on Programming Languages and Systems, 7(3):426-445, July 1985.
[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]
James W. O'Toole Jr. and David K. Gifford. Type reconstruction with first-class polymorphic values. In Proceedings of the SIGPLAN'89 Conference on Programming Language Design and Implementation, Portland, Oregon, pages 207- 217. ACM Press, June 1989.
[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. In CSL'89 ~ Thzrd Workshop on Computer Science Logic. Springer Verlag, 1990. To appear.
[15]
Christine Paulin-Mohring. Extraction de programmes dans le Calcul des Conslructzons. PhD thesis, Universit~ Paris VII, January 1989.
[16]
John Reynolds. Three approaches to type structure. In Hartmut Ehrig, Christiane Floyd, Maurice Nivat, and James Thatcher, editors, Mathematical Foundations of Software Development, pages 97-138. Springer-Verlag LNCS 185, March 1985.
[17]
Philip Wadler. Theorems for free! In The Fourth International Conference on Functional Programmzng Languages and Computer Architecture, pages 347-359. ACM Press, September 1989.
Index Terms
- Compiling the polymorphic λ-calculus
Recommendations
Label dependent lambda calculus and gradual typing
Dependently-typed programming languages are gaining importance, because they can guarantee a wide range of properties at compile time. Their use in practice is often hampered because programmers have to provide very precise types. Gradual typing is a ...
Empty types in polymorphic lambda calculus
POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languagesThe model theory of simply typed and polymorphic (second-order) lambda calculus changes when types are allowed to be empty. For example, the “polymorphic Boolean” type really has exactly two elements in a polymorphic model only if the “absurd” type ∀t.t ...
Polymorphic lambda calculus with context-free session types
AbstractSession types provide a typing discipline for structured communication on bidirectional channels. Context-free session types overcome the restriction to tail recursive protocols characteristic of conventional session types. This ...
Comments
Information & Contributors
Information
Published In
Sept. 1991
333 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/115866
- Editor:
- Richard L. Wexelblat
Copyright © 1991 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 May 1991
Published in SIGPLAN Volume 26, Issue 9
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 238Total Downloads
- Downloads (Last 12 months)34
- Downloads (Last 6 weeks)10
Reflects downloads up to 30 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in