A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus
Thomas Streicher · Logical Methods in Computer Science · 2017
We study a classical realizability model (in the sense of J.-L. Krivine) arising from a model of untyped lambda calculus in coherence spaces. We show that this model validates countable choice using bar recursion and bar induction.