13 citations · 13 across the 2 of their papers we have counts for
2 papers
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★ 13 cited
Church => Scott = Ptime: an application of resource sensitive realizability
Aloïs Brunel, Kazushige Terui
We introduce a variant of linear logic with second order quantifiers and type fixpoints, both restricted to purely linear formulas. The Church encodings of binary words are typed b…