Results 1 -
1 of
1
Execution time of lambda-terms via non uniform semantics and intersection types. Research report
, 2006
"... Abstract. The relational semantics for Linear Logic induces a semantics for the type free Lambda Calculus. This one is built on non-idempotent intersection types. We give a principal typing property for this type system. We then prove that the size of the derivations is closely related to the execut ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract. The relational semantics for Linear Logic induces a semantics for the type free Lambda Calculus. This one is built on non-idempotent intersection types. We give a principal typing property for this type system. We then prove that the size of the derivations is closely related to the execution time of lambda-terms in a particular environment machine, Krivine’s machine.

