A characterization of F-complete type assignments
- 31 December 1986
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 45, 121-157
- https://doi.org/10.1016/0304-3975(86)90043-5
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Type theories, normal forms, and D∞-lambda-modelsInformation and Computation, 1987
- Completeness of type assignment in continuous lambda modelsTheoretical Computer Science, 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
- On the semantics of polymorphismActa Informatica, 1983
- The Expressiveness of Simple and Second-Order Type StructuresJournal of the ACM, 1983
- Functional Characters of Solvable TermsMathematical Logic Quarterly, 1981
- An extension of the basic functionality theory for the $\lambda$-calculus.Notre Dame Journal of Formal Logic, 1980
- A new type assignment for λ-termsArchive for Mathematical Logic, 1978