PX: a computational logic
Theory of algebraic invariants
Theory of algebraic invariants
A semantics of evidence for classical arithmetic
Journal of Symbolic Logic
Software engineering (6th ed.)
Software engineering (6th ed.)
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
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)
Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work)
Fundamenta Informaticae - Logic for Pragmatics
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
Inductive logic programming: yet another application of logic
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work)
Fundamenta Informaticae - Logic for Pragmatics
| 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 game theoretical semantics corresponding to these interpretations, which is likely to be the right architectural basis for proof animation.