1274 search results - page 1 / 255 » Graph lambda theories |
CSL
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
MSCS
2008
13 years 5 months ago
2008
ENTCS
2002
13 years 5 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
TABLEAUX
2009
Springer
13 years 11 months ago
2009
Springer
base types and disallows lambda abstractions and quantifiers. We show that this fragment has the finite model property and that satisfiability can be decided with a terminating ...
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...