A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The Minimal Graph Model of Lambda Calculus
[chapter]
2003
Lecture Notes in Computer Science
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 equational 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
doi:10.1007/978-3-540-45138-9_24
fatcat:dpc7xdg6qze7fj3ewmpinj5sky