A PER model of polymorphism and recursive types
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 355-365
- https://doi.org/10.1109/lics.1990.113761
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Computational lambda-calculus and monadsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A semantic basis for questPublished by Association for Computing Machinery (ACM) ,1990
- Domain theoretic models of polymorphismInformation and Computation, 1989
- dI-domains as a model of polymorphismPublished by Springer Nature ,1988
- Categorical semantics for higher order polymorphic lambda calculusThe Journal of Symbolic Logic, 1987
- An ideal model for recursive polymorphic typesInformation and Control, 1986
- The Category-Theoretic Solution of Recursive Domain EquationsSIAM Journal on Computing, 1982
- Data Types as LatticesSIAM Journal on Computing, 1976
- A Powerdomain ConstructionSIAM Journal on Computing, 1976
- Models and computabilityLecture Notes in Mathematics, 1973