Author:
Escardó Martín,Oliva Paulo
Reference18 articles.
1. The Russell–Prawitz modality;Aczel;Mathematical Structures in Computer Science,2001
2. On the computational content of the axiom of choice;Berardi;The Journal of Symbolic Logic,1998
3. Modified bar recursion and classical dependent choice;Berger;Lecture Notes in Logic,2005
4. A proof of strong normalisation using domain theory;Coquand;Logical Methods in Computer Science,2007
5. M.H. Escardó, Infinite sets that admit fast exhaustive search, in: Proceedings of LICS, 2007, pp. 443–452.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Smart Choices and the Selection Monad;Logical Methods in Computer Science;2023-04-20
2. A General Glivenko–Gödel Theorem for Nuclei;Electronic Proceedings in Theoretical Computer Science;2021-12-29
3. Smart Choices and the Selection Monad;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
4. Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice;Journal of Logic and Computation;2019-06-06
5. A Kuroda-style j-translation;Archive for Mathematical Logic;2018-12-13