A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Total Functionals and Well-Founded Strategies
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Dependent choice, 'quote' and the clock
Theoretical Computer Science
Mathematical Structures in Computer Science
Getting results from programs extracted from classical proofs
Theoretical Computer Science
Classical logic as limit completion
Mathematical Structures in Computer Science
Mathematics based on incremental learning: excluded middle and inductive inference
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Can Proofs be Animated by Games?
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work)
Fundamenta Informaticae - Logic for Pragmatics
A Calculus of Realizers for EM1 Arithmetic (Extended Abstract)
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Toward the interpretation of non-constructive reasoning as non-monotonic learning
Information and Computation
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A deconstruction of non-deterministic classical cut elimination
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Semantics for intuitionistic arithmetic based on Tarski games with retractable moves
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Positive arithmetic without exchange is a subclassical logic
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
A new translation for semi-classical theories: backtracking without CPS
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Estimation of the length of interactions in arena game semantics
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Can proofs be animated by games?
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Naming proofs in classical propositional logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Interactive Realizers: A New Approach to Program Extraction from Nonconstructive Proofs
ACM Transactions on Computational Logic (TOCL)
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work)
Fundamenta Informaticae - Logic for Pragmatics
Can Proofs be Animated by Games?
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Proof Nets for Herbrand’s Theorem
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |