Type inference with recursive types: Syntax and semantics

Information and Computation

Volumn 92, Issue 1, 1991, Pages 48-80

  Cardone, Felice ^a   Coppo, Mario ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY;

LAMBDA CALCULUS; RECURSIVE TYPES; SEMANTICS; SYNTAX; TYPE INFERENCE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0026153476     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(91)90020-3     Document Type: Article

References (36)

1. A filter lambda model and the completeness of type assignment
2. Type Assignment in Lambda Calculus
3. The solution of two star height problems for regular trees
4. Completeness of type assignment in continuous lambda models
5. A completeness theorem for recursively defined types
6. Type inference and logical relations
7. Fundamental properties of infinite trees
8. Algorithmes d'équivalence et de réduction à des expressions minimales, dans une classe d'équations recursive simples
9. Modified basic functionality in combinatory logic
10. Type Assignment in Programming Languages
11. Principal type schemes for functional programs
12. Algebras and combinators
13. Edinburgh LCF
14. The principal type scheme of an object in combinatory logic
15. The completeness theorem for typing λ-terms
16. Résolution d'équations dans les langages d'ordre 1, 2, …, ω
17. Set-theoretical models of λ-calculus: Theories, expansions, isomorphisms
18. An ideal model for recursive polimorphic types
19. Recursive types and type constraints in second order lambda calculus
20. A theory of type polymorphism in programming
21. Type inference and type containment
22. On proving limiting completeness
23. Three approaches to type structure
24. Continuous Lattices
25. Domains for denotational semantics
26. ∞-models of the lambda-calculus
27. A simple algorithm and proof for type inference