inria-00380183, version 1
Models and theories of lambda calculus
(2009)
Abstract: In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotational semantics and equational/order theories of the pure untyped lambda-calculus. The main research achievements include: (i) a general construction of lambda-models from reflexive objects in (possibly non-well-pointed) categories; (ii) a Stone-style representation theorem for combinatory algebras; (iii) a proof that no effective lambda-model can have lambda-beta or lambda-beta-eta as its equational theory (this can be seen as a partial answer to an open problem introduced by Honsell-Ronchi Della Rocca in 1984).
- a – INRIA-Rocquencourt
- 1: MOSCOVA (INRIA Rocquencourt)
- INRIA
- Domain : Computer Science/Logic in Computer Science
- Keywords : \lambda-calculus – lattice of lambda-theories – indecomposable semantics – Stone representation theorem for combinatory algebras – algebraic incompleteness of lambda-calculus – relational semantics – effective models – Lowenheim-Skolem theorem for graph models
- inria-00380183, version 1
- http://hal.inria.fr/inria-00380183
- oai:hal.inria.fr:inria-00380183
- From: Giulio Manzonetto
- Submitted on: Thursday, 30 April 2009 10:26:23
- Updated on: Thursday, 30 April 2009 10:27:47







Associated documents

Export