Abstract
We will present several results on two types of continuous models of λ-calculus, namely graph models and extensional models. By introducing a variant of Engeler's model construction, we are able to generalize the results of [7] and to give invariants that determine a large family of graph models up to applicative isomorphism. This covers all graph models considered in the litterature so far. We indicate briefly how these invariants may be modified in order to determine extensional models as well.
Furthermore, we use our construction to exhibit \(2^{N_0 } \)graph models that are not equationally equivalent. We indicate once again how the construction passes on to extensional models.
Similar content being viewed by others
References
Barendregt, H., The λ-calculus. Its syntax and semantics, North-Holland, Amsterdam, 1984.
Hoofman, R., & H. Schellinx, ‘Collapsing graph models by preorders’, Proc. Category theory and Computer Science, Lecture Notes in Computer Science vol. 530, Springer Verlag, Berlin, 1991, p. 53–;73.
Kerth, R., ‘Définissabilite dans les domaines réflexifs’, Comptes rendus de l'Academie des Sciences t. 318, Série I, 1994, p. 685–;688.
Longo, G., ‘Set-theoretical models of λ-calculus: theories, expansions, isomorphisms’, Annals of Pure and Applied Logic vol. 24, 1983, p. 153–;188.
Krivine, J. L., Lambda-calculus, Types and Models, Ellis Horwood, Hemel Hempstead, 1993.
Plotkin, G., ‘Set-theoretical and other elementary models of λ-calculus’, Theoretical Computer Science vol. 121,no. 1–;2, 1993, p. 351–;410.
Schellinx, H, ‘Isomorphisms and nonisomorphisms of graph models’, Journal of Symbolic Logic vol. 56,no. 1, 1991, p. 227–;249.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kerth, R. Isomorphism and Equational Equivalence of Continuous λ-Models. Studia Logica 61, 403–415 (1998). https://doi.org/10.1023/A:1005018121791
Issue Date:
DOI: https://doi.org/10.1023/A:1005018121791