PX: a computational logic
Theory of algebraic invariants
Theory of algebraic invariants
A semantics of evidence for classical arithmetic
Journal of Symbolic Logic
Software requirements & specifications: a lexicon of practice, principles and prejudices
Software requirements & specifications: a lexicon of practice, principles and prejudices
Towards the animation of proofs---testing proofs by examples
Theoretical Computer Science - Special issue on theories of types and proofs
Towards Limit Computable Mathematics
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Software Engineering (7th Edition)
Software Engineering (7th Edition)
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in 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)
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1
TLCA '09 Proceedings of the 9th 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
Hi-index | 0.00 |
Proof animation is a way of executing proofs to find errors in the formalization of proofs. It is intended to be "testing in proof engineering". Although the realizability interpretation as well as the functional interpretation based on limit-computations were introduced as means for proof animation, they were unrealistic as an architectural basis for actual proof animation tools. We have found a game theoretic semantics corresponding to these interpretations, which is likely to be the right architectural basis for proof animation.