6 citations · 6 across the 6 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
Revisiting the duality of computation: an algebraic analysis of classical realizability models
Étienne Miquey
In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories.…
cs.LO2019
A constructive proof of dependent choice in classical arithmetic via memoization
Étienne Miquey
In a recent paper, Herbelin developed dPA, a calculus in which constructive proofs for the axioms of countable and dependent choices could be derived via the memoization of c…