Abstract: A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least equational lambda-theory (=Lb). In this paper we make use of the Visser topology for investigating the more general question of whether the equational (resp. order) theory of a non syntactical model M, say Eq(M) (resp. Ord(M)) can be recursively enumerable (= r.e. below). We conjecture that no such model exists and prove the conjecture for several large classes of models. In particular we introduce a notion of effective lambda-model and show that for all effective models M, Eq(M) is different from Lb, and Ord(M) is not r.e. If moreover M belongs to the stable or strongly stable semantics, then Eq(M) is not r.e. Concerning Scott's continuous semantics we explore the class of (all) graph models, show that it satisfies Lowenheim Skolem theorem, that there exists a minimum order/equational graph theory, and that both are the order/equ theories of an effective graph model. We deduce that no graph model can have an r.e. order theory, and also show that for some large subclasses, the same is true for Eq(M).
Recommendations
Cited in
(21)- On the completeness of order-theoretic models of the \(\lambda \)-calculus
- Constructive \(\lambda\)-models
- Order-incompleteness and finite lambda reduction models
- On a question of H. Friedman
- Varying \(\Lambda\) theory revisited
- On the characterization of models of H^: the semantical aspect
- Lambda theories allowing terms with a finite number of fixed points
- Graph lambda theories
- Effective λ-models versus recursively enumerable λ-theories
- Effectively given domains and lambda-calculus models
- The interpretation of unsolvable λ-terms in models of untyped λ-calculus
- scientific article; zbMATH DE number 599151 (Why is no real title available?)
- Decidability of all minimal models
- On the equational consistency of order-theoretic models of the lambda-calculus
- scientific article; zbMATH DE number 794258 (Why is no real title available?)
- Minimal -theories by ultraproducts
- Models of -calculus and the weak MSO logic
- Mathematical Foundations of Computer Science 2003
- Graph models of $\lambda$-calculus at work, and variations
- On the construction of stable models of untyped -calculus
- Genericity through stratification
This page was built for publication: Lambda Theories of Effective Lambda Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608418)
