Call-by-value non-determinism in a linear logic type discipline - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Call-by-value non-determinism in a linear logic type discipline

(1, 2) , (2) , (2)
1
2

Abstract

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent intersection types, we endow this calculus with a type system based on the so-called Girard's second translation of intuitionistic logic into linear logic. We prove that a term is typable if and only if it is converging, and that its typing tree carries enough information to give a bound on the length of its lazy call-by-value reduction. Moreover, when the typing tree is minimal, such a bound becomes the exact length of the reduction.
Fichier principal
Vignette du fichier
main.pdf (204.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00919463 , version 1 (16-12-2013)

Identifiers

Cite

Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani. Call-by-value non-determinism in a linear logic type discipline. LFCS - Logical Foundations of Computer Science - 2013, Jan 2013, San Diego, CA, United States. pp.164-178, ⟨10.1007/978-3-642-35722-0_12⟩. ⟨hal-00919463⟩
202 View
169 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More