135 search results - page 4 / 27 » A typed lambda calculus with intersection types |
131
Voted
FOSSACS
2000
Springer
15 years 6 months ago
2000
Springer
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constru...
98
Voted
APAL
2008
15 years 2 months ago
2008
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
135
Voted
ENTCS
2002
15 years 2 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...
137
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of -theories. Relying on the notion of easy intersection type theory we succes...
143
Voted
ASIAN
2006
Springer
15 years 6 months ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...