An ideal model for recursive polymorphic types
Open Access
- 30 November 1986
- journal article
- Published by Elsevier in Information and Control
- Vol. 71 (1-2) , 95-130
- https://doi.org/10.1016/s0019-9958(86)80019-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- The completeness theorem for typing λ-termsTheoretical Computer Science, 1983
- The Category-Theoretic Solution of Recursive Domain EquationsSIAM Journal on Computing, 1982
- 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
- Metric interpretations of infinite trees and semantics of non deterministic recursive programsTheoretical Computer Science, 1980
- Sur les opérations dans les ensembles abstraits et leur application aux équations intégralesFundamenta Mathematicae, 1922