A prismoid framework for languages with resources - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2011

A prismoid framework for languages with resources

(1) , (1)
1

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.
Fichier principal
Vignette du fichier
main.pdf (352.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00625598 , version 1 (22-09-2011)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More