Type inference and type containment
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 257-277
- https://doi.org/10.1007/3-540-13346-1_13
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A types-as-sets semantics for milner-style polymorphismPublished by Association for Computing Machinery (ACM) ,1984
- The completeness theorem for typing λ-termsTheoretical Computer Science, 1983
- Curry's type-rules are complete with respect to the F-semantics tooTheoretical Computer Science, 1983
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- The Expressiveness of Simple and Second-Order Type StructuresJournal of the ACM, 1983
- Polymorphic type inferencePublished by Association for Computing Machinery (ACM) ,1983
- What is a model of the lambda calculus?Information and Control, 1982
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982
- A semantic model of types for applicative languagesPublished by Association for Computing Machinery (ACM) ,1982
- Towards a theory of type structureLecture Notes in Computer Science, 1974