A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus
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.
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2017-12-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/4129/pdf |
Summary: | 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. |
---|---|
ISSN: | 1860-5974 |