Studying the fully abstract model of PCF within its continuous function model
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 230-244
- https://doi.org/10.1007/bfb0037109
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Equationally fully abstract models of PCFPublished by Springer Nature ,2006
- Reasoning about sequential functions via logical relationsPublished by Cambridge University Press (CUP) ,1992
- Completeness, invariance and λ-definabilityThe Journal of Symbolic Logic, 1982
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977