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

Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani
2013 Lecture Notes in Computer Science  
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
more » ... mation 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.
doi:10.1007/978-3-642-35722-0_12 fatcat:jlxryisb2ja6zopk6mb7mqmhvq