Extending ML with semi-explicit higher-order polymorphism-Reference-Cited by-同舟云学术

Extending ML with semi-explicit higher-order polymorphism

Published:1997 Issue: Volume: Page:20-46
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Garrigue Jacques,Rémy Didier

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0014546

Reference17 articles.

1. Luca Cardelli. An implementation of FSub. Research Report 97, Digital Equipment Corporation Systems Research Center, 1993.

2. L. Damas and R. Milner. Principal type-schemes for functional programs. In Proc. ACM Symposium on Principles of Programming Languages, pages 207–212. ACM Press, January 1982.

3. Dominic Duggan. Polymorphic methods with self types for ML-like languages. Technical report cs-95-03, University of Waterloo, 1995.

4. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: a rulebased survey of unification. In Jean-Louis Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257–321. MIT-Press, Cambridge (MA, USA), 1991.

5. A. J. Kfoury and J. B. Wells. A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus. In ACM conference on Lisp and functional programming, pages 196–207, Orlando, Florida, June 1994.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism;Proceedings of the ACM on Programming Languages;2024-01-05

2. Simple, partial type-inference for System F based on type-containment;ACM SIGPLAN Notices;2005-09-12

3. Using, Understanding, and Unraveling the OCaml Language From Practice to Theory and Vice Versa;Lecture Notes in Computer Science;2002

4. Local type inference;ACM Transactions on Programming Languages and Systems;2000-01

5. First-Class Contexts in ML;Advances in Computing Science ASIAN 98;1998