Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
A Natural Language Explanation for Formal Proofs
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Modelisation of Timed Automata in Coq
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Parametric higher-order abstract syntax for mechanized semantics
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Modular development of certified program verifiers with a proof assistant1,2
Journal of Functional Programming
Effective interactive proofs for higher-order imperative programs
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
An Isabelle/HOL-based model of stratego-like traversal strategies
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A verified compiler for an impure functional language
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
JACK: a tool for validation of security and behaviour of Java applications
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Automation for Dependently Typed Functional Programming
Fundamenta Informaticae - Dependently Typed Programming
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Trace-based verification of imperative programs with I/O
Journal of Symbolic Computation
An Isabelle-like procedural mode for HOL light
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Mostly-automated verification of low-level programs in computational separation logic
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Verifying B proof rules using deep embedding and automated theorem proving
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
A proof-theoretic approach to tactics
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Proving equalities in a commutative ring done right in coq
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Automated certification of implicit induction proofs
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
The HERMIT in the machine: a plugin for the interactive transformation of GHC core language programs
Proceedings of the 2012 Haskell Symposium
Typed syntactic meta-programming
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Programming and reasoning with algebraic effects and dependent types
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
An operational foundation for the tactic language of Coq
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
We propose a new tactic language for the system Coq, which is intended to enrich the current tactic combinators (tacticals). This language is based on a functional core with recursors and matching operators for Coq terms but also for proof contexts. It can be used directly in proof scripts or in toplevel definitions (tactic definitions). We show that the implementation of this language involves considerable changes in the interpretation of proof scripts, essentially due to the matching operators. We give some examples which solve small proof parts locally and some others which deal with non-trivial problems. Finally, we discuss the status of this meta-language with respect to the Coq language and the implementation language of Coq.