Mtac: A monad for typed tactic programming in Coq. (2015)

• Record Type: Journal Article
• Authors: ZILIANI, BETA; DREYER, DEREK; KRISHNASWAMI, NEELAKANTAN R.; NANEVSKI, ALEKSANDAR; VAFEIADIS, VIKTOR
• Is Part Of: Journal of functional programming. Volume 25(2015)
• Publication Date: 2015
• Subjects: Functional programming (Computer science) -- Periodicals
• DOI: 10.1017/S0956796815000118
• Languages: English
• ISSNs: 0956-7968

Abstract

Abstract: Effective support for custom proof automation is essential for large-scale interactive proof development. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely on advanced type-theoretic machinery that is not easily integrated into established theorem provers. We present Mtac, a lightweight but powerful extension to Coq that supports dependently typed tactic programming. Mtac tactics have access to all the features of ordinary Coq programming, as well as a new set of typed tactical primitives. We avoid the need to touch the trusted kernel typechecker of Coq by encapsulating uses of these new tactical primitives in a monad, and instrumenting Coq so that it executes monadic tactics during type inference.