Recent developments in mega's proof search programming language

The development of interactive tactic based theorem provers started with the LCF system [10], a system to support automated reasoning in Dana Scotts “Logic for Computable Functions”. The main idea was to base the prover on a small trusted kernel, while also allowing for ordinary user extensions without compromising soundness. For that purpose Milner designed the functional programming language ML and embedded LCF into ML. ML allowed to represent subgoaling strategies by functions, called tactics, and to combine them by higher order functions, called tacticals. By declaring an abstract type theorem with only simple inference rules type checking guaranteed that tactics decompose to primitive inference rules. While allowing for efficient execution of recorded proofs by

[1]  Alan Bundy,et al.  The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.

[2]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

[3]  Serge Autexier,et al.  Textbook Proofs Meet Formal Logic - The Problem of Underspecification and Granularity , 2005, MKM.

[4]  Don Syme,et al.  Three Tactic Theorem Proving , 1999, TPHOLs.

[5]  Dominik Dietrich,et al.  Crystal: Integrating Structured Queries into a Tactic Language , 2010, Journal of Automated Reasoning.

[6]  Serge Autexier,et al.  A Tactic Language for Declarative Proofs , 2010, ITP.

[7]  Andrzej Trybulec,et al.  Computer Assisted Reasoning with MIZAR , 1985, IJCAI.

[8]  Dieter Hutter.  Management of change in structured verification , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.

[9]  Serge Autexier,et al.  Hierarchical contextual reasoning , 2003 .

[10]  Markus Wenzel,et al.  Isar - A Generic Interpretative Approach to Readable Formal Proof Documents , 1999, TPHOLs.

[11]  Serge Autexier,et al.  Atomic Metadeduction , 2009, KI.

[12]  Pierre Corbineau,et al.  A Declarative Language for the Coq Proof Assistant , 2007, TYPES.

[13]  Lawrence C. Paulson,et al.  Lightweight relevance filtering for machine-generated resolution problems , 2009, J. Appl. Log..

[14]  John Harrison,et al.  Proof Style , 1996, TYPES.

[15]  Yves Bertot,et al.  Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings , 1999 .

[16]  Vincent Zammit,et al.  On the Implementation of an Extensible Declarative Proof Language , 1999, TPHOLs.

[17]  W. Reif,et al.  Theorem Proving in Large Theories , 1998 .

[18]  Serge Autexier,et al.  Synthesizing Proof Planning Methods and Omega-Ants Agents from Mathematical Knowledge , 2006, MKM.