Translating types and effects with state monads and linear logic

Paolo Tranquilli (1)

1 LIP - Laboratoire de l'Informatique du Parallélisme

We study a lambda-calculus with references and a types and effects system. In the first part of the paper, we translate it into the ordinary lambda-calculus with products, implementing an interacting family of state monads localized at sets of regions. In general the target language must be endowed with recursive types. However we prove that the stratification condition on regions, already used in type and effect systems to assure termination, is equivalent to completely avoid the use of recursion in the types used in the translation. We thus obtain a logical characterization of stratification, and by simulation we also provide a new proof that it yields termination. In the second part of the paper we extend the call-by-value translation of ordinary lambda-terms in linear logic proof nets to the calculus with references. This allows for a parallel evaluation of the calculus that preserves its sequential semantics.

Mots clés: lambda-calculus; types and effects; monads; linear logic

Domaines: Logique en informatique [cs.LO]

Paolo Tranquilli. Translating types and effects with state monads and linear logic. 2010. ⟨hal-00465793⟩