POPL 2018 (series) / CoqPL 2018 (series) / The Fourth International Workshop on Coq for Programming Languages /
A “destruct” Tactic for Mtac2
Sat 13 Jan 2018 10:30 - 10:55 at Watercourt A - Tactics and Proof Engineering Chair(s): Benjamin Delaware
We present a “destruct” tactic that supports dependent types written in Mtac2. The tactic is implemented to a large degree in Coq itself — only using Mtac2’s unsafe features when absolutely necessary. To this end, the development includes fully-typed descriptions of 1) inductive datatypes, 2) arguments of inductive datatypes, 3) constructors of inductive dataypes, 4) branches of matches on values of inductive datatypes, and 5) return types of matches on values of inductive datatypes. Additionally, we also propose a way of dealing with meta-programs that are parametric in Prop/Type.
Kaiser-Ziliani-CoqPL18.pdf (Kaiser-Ziliani-CoqPL18.pdf) | 532KiB |
Sat 13 JanDisplayed time zone: Tijuana, Baja California change
Sat 13 Jan
Displayed time zone: Tijuana, Baja California change
10:30 - 12:10 | |||
10:30 25mTalk | A “destruct” Tactic for Mtac2 CoqPL File Attached | ||
10:55 25mTalk | Typed Template Coq CoqPL Simon Boulier , Matthieu Sozeau Inria, Nicolas Tabareau Inria, France, Abhishek Anand Cornell University File Attached | ||
11:20 25mTalk | Elpi: an extension language for Coq CoqPL Enrico Tassi INRIA File Attached | ||
11:45 25mTalk | Coqatoo: Generating Natural Language Versions of Coq Proofs CoqPL Andrew Bedford Laval University File Attached |