An extended polymorphic type system for applicative languages-Reference-Cited by-同舟云学术

An extended polymorphic type system for applicative languages

Published: Issue: Volume: Page:194-204
ISSN:
Container-title:Mathematical Foundations of Computer Science 1980
language:
Short-container-title:

Author:

Coppo Mario

Publisher

Springer-Verlag

Link

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

Reference17 articles.

1. C. Ben-Yelles “Type assignment in the lambda-calculus: Syntax and Semantics”, P.h.D. thesis, University of Wales (1979)

2. M. Coppo, M. Dezani-Ciancaglini. “An extension of Basic Functionality theory for λ-calculus”, Internal report, University of Turin. To appear in “Notre Dame Journal of Formal Logic”

3. M. Coppo, M. Dezani-Ciancaglini, B. Venneri. “Principal Type Schemes and calculus Semantics” Internal report, University of Turin. To appear in: To H.B. Curry, Essays on Combinatory Logic, Lambda-calculus and Formalism, eds. R. Hindley and J.P. Seldin, Academic Press (1980).

4. H.B. Curry,R.Feys “Combinatory Logic I”, North-Holland (1958)

5. A. Demers, J. Donahue “Report on the Programming Language Russel”, TR79-371, Computer Science Department, Cornell University (1979)

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

1. Type Inference for Rank-2 Intersection Types Using Set Unification;Lecture Notes in Computer Science;2022

2. Intersection, Universally Quantified, and Reference Types;Computer Science Logic;2009

3. Abstract Data Types in Computer Algebra;Lecture Notes in Computer Science;2000

4. Usage analysis with natural reduction types;Static Analysis;1993

5. Types with intersection: An introduction;Formal Aspects of Computing;1992-09