Execution Time of $\lambda$-Terms via Denotational Semantics and Intersection Types - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

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

(1)
1

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.
Fichier principal
Vignette du fichier
RR-6638.pdf (422.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00319822 , version 1 (09-09-2008)

Identifiers

  • HAL Id : inria-00319822 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More