3 citations · 3 across the 3 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2012
Indexed realizability for bounded-time programming with references and type fixpoints
Aloïs Brunel, Antoine Madet
The field of implicit complexity has recently produced several bounded-complexity programming languages. This kind of language allows to implement exactly the functions belonging t…
cs.LO2010
An affine-intuitionistic system of types and effects: confluence and termination
Roberto Amadio, Patrick Baillot, Antoine Madet
We present an affine-intuitionistic system of types and effects which can be regarded as an extension of Barber-Plotkin Dual Intuitionistic Linear Logic to multi-threaded programs…
cs.LO2009★ 3 cited
An affine-intuitionistic system of types and effects: confluence and termination
Roberto Amadio, Patrick Baillot, Antoine Madet
We present an affine-intuitionistic system of types and effects which can be regarded as an extension of Barber-Plotkin Dual Intuitionistic Linear Logic to multi-threaded programs…