3 citations · 3 across the 3 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.PL2012
A polynomial time λ-calculus with multithreading and side effects
Antoine Madet
The framework of Light Logics has been extensively studied to control the complexity of higher-order functional programs. We propose an extension of this framework to multithreaded…
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…