Isomorphism and equational equivalence of continuous λ-models

Studia Logica 61 (3):403-415 (1998)
  Copy   BIBTEX


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 graph models that are not equationally equivalent. We indicate once again how the construction passes on to extensional models.



    Upload a copy of this work     Papers currently archived: 92,323

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

17 (#873,341)

6 months
4 (#798,384)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.

Add more references