Skip to Main content Skip to Navigation
Journal articles

A prismoid framework for languages with resources

Abstract : Inspired by the Multiplicative Exponential fragment of Linear Logic, we define a framework called the prismoid of resources where each vertex is a language which refines the lambda-calculus by using a different choice to make explicit or implicit (meta-level) the definition of the contraction, weakening, and substitution operations. For all the calculi in the prismoid we show simulation of beta-reduction, confluence, preservation of beta-strong normalisation and strong normalisation for typed terms. Full composition also holds for all the calculi of the prismoid handling explicit substitutions. The whole development of the prismoid is done by making the set of resources a parameter of the formalism, so that all the properties for each vertex are obtained as a particular case of the general abstract proofs.
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Fabien Renaud Connect in order to contact the contributor
Submitted on : Thursday, September 22, 2011 - 10:40:56 AM
Last modification on : Friday, January 8, 2021 - 11:22:05 AM
Long-term archiving on: : Tuesday, November 13, 2012 - 2:16:06 PM


Files produced by the author(s)




Delia Kesner, Fabien Renaud. A prismoid framework for languages with resources. Theoretical Computer Science, Elsevier, 2011, 412 (37), pp.4867-4892. ⟨10.1016/j.tcs.2011.01.026⟩. ⟨hal-00625598⟩



Record views


Files downloads