Linearity in the non-deterministic call-by-value setting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Linearity in the non-deterministic call-by-value setting


We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity present in such formalisms. After proving the subject reduction and the strong normalisation properties, we propose a translation of this calculus into the System F with pairs, which corresponds to a non linear fragment of linear logic. The translation provides a deeper understanding of the linearity in our setting.

Dates and versions

hal-00924992 , version 1 (07-01-2014)



Alejandro Díaz-Caro, Barbara Petit. Linearity in the non-deterministic call-by-value setting. WoLLIC - 19th International Workshop on Logic, Language, Information and Computation - 2012, Sep 2012, Buenos Aires, Argentina. pp.216-231, ⟨10.1007/978-3-642-32621-9_16⟩. ⟨hal-00924992⟩
142 View
0 Download



Gmail Facebook X LinkedIn More