A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus
arXiv:1407.1547 · doi:10.23638/LMCS-13(4:24)2017
Abstract
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.