Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Execution Time of $\lambda$-Terms via Denotational Semantics and Intersection Types

Daniel de Carvalho 1 
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The multiset based relational semantics for linear logic induces a semantics for the type free $\lambda$-calculus. This one is built on non-idempotent intersection types. We prove that the size of the derivations and the size of the types are closely related to the execution time of $\lambda$-terms in a particular environment machine, Krivine's machine.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Daniel De Carvalho Connect in order to contact the contributor
Submitted on : Tuesday, September 9, 2008 - 2:40:21 PM
Last modification on : Wednesday, October 26, 2022 - 8:16:44 AM
Long-term archiving on: : Friday, June 4, 2010 - 11:07:52 AM


Files produced by the author(s)


  • HAL Id : inria-00319822, version 1



Daniel de Carvalho. Execution Time of $\lambda$-Terms via Denotational Semantics and Intersection Types. [Research Report] RR-6638, INRIA. 2008, pp.39. ⟨inria-00319822⟩



Record views


Files downloads