 |
PREUVES, PROGRAMMES et SYSTÈMES |  |
|
PREUVES, PROGRAMMES et SYSTÈMES | |
| HAL: hal-00149557, version 1 |
| Detailed view |  Export this paper |
 |
| Mathematical Foundations of Computer Science, Bratislava : Slovaquie (2003) |
|
|
|
|
| The Minimal Graph Model of Lambda Calculus |
|
|
| Antonio Bucciarelli 1Antonino Salibra 2 |
|
|
| (2003) |
|
|
|
| A longstanding open problem in lambda-calculus, raised by G.Plotkin, is whether there exists a continuous model of the untyped lambda-calculus whose theory is exactly the beta-theory or the beta-eta-theory. A related question, raised recently by C.Berline, is whether, given a class of lambda-models, there is a minimal theory represented by it. In this paper, we give a positive answer to this latter question for the class of graph models à la Plotkin-Scott-Engeler. In particular, we build a graph model in which the equations satisfied are exactly those satisfied in any graph model. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
| 2: | Dipartimento di Informatica |
|
|
|
Università "Cà Foscari", Veneziz |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Logic in Computer Science |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00149557, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00149557 | |
| oai:hal.archives-ouvertes.fr:hal-00149557 | |
| From: Antonio Bucciarelli | |
| Submitted on: Saturday, 26 May 2007 19:32:00 | |
| Updated on: Tuesday, 29 May 2007 16:34:24 | |
