Abstract
We give a concrete presentation of the inequationally fully abstract model of PCF as a continuous projection of the inductively reachable subalgebra of PCF's continuous function model.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. The lazy lambda calculus. In D. L. Turner, editor, Research Topics in Functional Programming, pages 65–116. Addison-Wesley, 1990.
G. Berry, P.-L. Curien and J.-J. Lévy. Full abstraction for sequential languages: the state of the art. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, pages 89–132. Cambridge University Press, 1985.
P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science. Pitman/Wiley, 1986.
A. Jung and J. Tiuryn. A new characterization of lambda definability. In this proceedings, 1993.
R. Milner. Fully abstract models of typed λ-calculi. Theoretical Computer Science, 4:1–22, 1977.
K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987.
G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223–256, 1977.
G.D. Plotkin. Lambda-definability in the full type hierarchy. In J. Seldin and J. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 363–374. Academic Press, 1980.
K. Sieber. Reasoning about sequential functions via logical relations. In M. P. Fourman, P. T. Johnstone and A. M. Pitts, editors, Applications of Categories in Computer Science, volume 177 of LMS Lecture Note Series, pages 258–269. Cambridge University Press, 1992.
R. Statman. Completeness, invariance and λ-definability. Journal of Symbolic Logic, 47:17–26, 1982.
A. Stoughton. Fully Abstract Models of Programming Languages. Research Notes in Theoretical Computer Science. Pitman/Wiley, 1988.
A. Stoughton. Equationally fully abstract models of PCF. In M. Main, A. Melton, M. Mislove and D. Schmidt, editors, Fifth International Conference on the Mathematical Foundations of Programming Semantics, volume 442 of Lecture Notes in Computer Science, pages 271–283. Springer-Verlag, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, A., Stoughton, A. (1993). Studying the fully abstract model of PCF within its continuous function model. In: Bezem, M., Groote, J.F. (eds) Typed Lambda Calculi and Applications. TLCA 1993. Lecture Notes in Computer Science, vol 664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037109
Download citation
DOI: https://doi.org/10.1007/BFb0037109
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56517-8
Online ISBN: 978-3-540-47586-6
eBook Packages: Springer Book Archive