Lambda theories of effective lambda models - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Lambda theories of effective lambda models

Résumé

A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least lambda-theory (i.e. beta-conversion). In this paper we investigate 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 in Scott's semantics and its refinements, 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 beta-conversion, 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 a 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).
Fichier principal
Vignette du fichier
CSL07.pdf (230.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00125816 , version 1 (24-01-2007)
hal-00125816 , version 2 (31-05-2007)

Identifiants

Citer

Chantal Berline, Giulio Manzonetto, Antonino Salibra. Lambda theories of effective lambda models. CSL'07, 16th EACSL Annual Conference on Computer Science and Logic, Sep 2007, Lausanne, Switzerland. pp.268-282, ⟨10.1007/978-3-540-74915-8⟩. ⟨hal-00125816v2⟩
119 Consultations
223 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More