30 search results - page 2 / 6 » Logic and Computation in a Lambda Calculus with Intersection... |
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
ASIAN
2006
Springer
13 years 8 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 ...
PPDP
2004
Springer
13 years 10 months ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
FOSSACS
2003
Springer
13 years 9 months ago
2003
Springer
We develop a system of type assignment with intersection types, union types, indexed types, and universal and existential dependent types that is sound in a call-by-value functiona...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...