Models and theories of lambda calculus
| dc.creator | Manzonetto, Giulio | |
| dc.date | 2009-04-30 | |
| dc.date.accessioned | 2026-07-07T13:10:07Z | |
| dc.date.available | 2026-07-07T13:10:07Z | |
| dc.description | 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). | |
| dc.identifier | https://arxiv.org/abs/0904.4756 | |
| dc.identifier | http://arxiv.org/abs/0904.4756 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/228956 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Models and theories of lambda calculus | |
| dc.type | text |