24 citations · 38 across the 4 of their papers we have counts for
Showing 2012Show all
2 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.LO2012★ 1 cited
Quantitative classical realizability
Aloïs Brunel
Introduced by Dal Lago and Hofmann, quantitative realizability is a technique used to define models for logics based on Multiplicative Linear Logic. A particularity is that functio…