Chapter

Logical Foundations of Computer Science

Volume 7734 of the series Lecture Notes in Computer Science pp 164-178

Call-by-Value Non-determinism in a Linear Logic Type Discipline

  • Alejandro Díaz-CaroAffiliated withUniversité Paris 13, Sorbonne Paris Cité, LIPN
  • , Giulio ManzonettoAffiliated withUniversité Paris 13, Sorbonne Paris Cité, LIPNCNRS, UMR 7030
  • , Michele PaganiAffiliated withUniversité Paris 13, Sorbonne Paris Cité, LIPNCNRS, UMR 7030

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We consider the call-by-value λ-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.

Keywords

λ-calculus linear logic non-determinism call-by-value