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
Liste complète des métadonnées

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00319822
Contributor : Daniel De Carvalho <>
Submitted on : Tuesday, September 9, 2008 - 2:40:21 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
Document(s) archivé(s) le : Friday, June 4, 2010 - 11:07:52 AM

File

RR-6638.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00319822, version 1

Collections

Citation

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

Share

Metrics

Record views

228

Files downloads

146