COQ TACTICS PLUS

With this work we hope to enhance the operational understanding of Ltac as well as to set up a framework to reason about Coq scripts and to build tools supporting tactic programming based on rigorous semantics.

We also give examples of Ltac programs and discuss some of the issues that the formal semantics help to clarify. The three semantics are provably equivalent and have been obtained via off-the-shelf derivation techniques of the functional correspondence and the syntactic correspondence. We present three formats of operational semantics, each of which has its use in the practice of tactic programming: a big-step specification in the form of natural semantics, a model of implementation in the form of an abstract machine, and a small-step characterization of computation in the form of reduction semantics. Categories and Subject Descriptors D.3.1 : Programming Languages-Formal definitions and theory F.3.2ДЄn Operational Foundation for the Tactic Language of Coq Institute of Computer Science University of Wroclaw Wojciech Jedynak Institute of Computer Science University of Wroclaw Malgorzata Biernacka Institute of Computer Science University of Wroclaw Dariusz Biernacki ABSTRACT We introduce a semantic toolbox for Ltac, the tactic language of the popular Coq proof assistant.

Theorem pluslbij: forall a b c : nat, a + b a + c -> b c. You can also prove it directly using primitive tactics and mathematical induction on a as follows.

COQ TACTICS PLUS

The three semantics are provably equivalent and have been obtained via off-the-shelf derivation techniques of the functional correspondence and the syntactic correspondence. As pointed out in Vinzs answer, you can find the bijectivity theorem about plus directly in the Coq standard library. Jedynak, Wojciech Biernacka, MaЕ‚gorzata Biernacki, DariuszДЄn Operational Foundation for the Tactic Language of Coq Institute of Computer Science University of Wroclaw Wojciech Jedynak Institute of Computer Science University of Wroclaw Malgorzata Biernacka Institute of Computer Science University of Wroclaw Dariusz Biernacki ABSTRACT We introduce a semantic toolbox for Ltac, the tactic language of the popular Coq proof assistant. and have simple syntaxes like Forth or Lisp.An operational foundation for the tactic language of Coq An operational foundation for the tactic language of Coq I'd be especially interested in tactic-defining languages that are dynamically typed and have good support for pretty-printing.

I think a gathering a list of these sublanguages would be interesting. I'm wondering what the alternatives are to writing a Coq extension in this way.ДЇrom what I can tell, Coq ships with at least two 'tactic scripting languages' of sorts: (I gave up on using dune or coq_makefile -f _CoqProject and just used a horrible Makefile to build all the artifacts manually.) cmxs file so Coq can find it.ДЄlso, the exact details of how you build such a thing appear to be very sensitive to the exact version of Coq and dune that you're using. which appears to call into the Mktop library and do some other stuff to register your. I've been tweaking the Coq plugin template recently to try to get a feel for writing custom Coq tactics in OCaml.