Theoretical Computer Science
Real theorem provers deserve real user-interfaces
SDE 5 Proceedings of the fifth ACM SIGSOFT symposium on Software development environments
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A logical framework for reasoning about logical specifications
A logical framework for reasoning about logical specifications
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
A meta-programming approach to realizing dependently typed logic programming
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Least and Greatest Fixed Points in Linear Logic
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Current techniques for building formal proofs interactively involve one or several proof languages for instructing an interpreter of the languages to build or check the proof being described. These linguistic approaches have a drawback: the languages are not generally portable, even though the nature of logical reasoning is universal. We propose a somewhat speculative alternative method that lets the user directly manipulate the text of the theorem, using non-linguistic metaphors. It uses a proof formalism based on linking subformulas, which is a variant of deep inference (inference rules are allowed to apply in any formula context) where the relevant formulas in a rule are allowed to be arbitrarily distant. We substantiate the design with a prototype implementation of a linking-based interactive prover for first-order classical linear logic.