A Tactic Language for Ergo

A new version of the Ergo theorem prover is under development. It uses a single tactic language, based on Angel, for tactic programming, user interface, and proof representation. This paper describes the language as it is used in each of these cases, and explains the details of its implementation in Qu-Prolog. An example from classical propositional calculus is included.

[1]  Jim Welsh,et al.  A tool for developing correct programs by refinement , 1996 .

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

[3]  Gerhard Gentzen,et al.  Investigations into Logical Deduction , 1970 .

[4]  Ian J. Hayes,et al.  Supporting Contexts in Program Refinement , 1997, Sci. Comput. Program..

[5]  T Vickers An Overview of a Refinement Editor , 1990 .

[6]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[7]  Richard Hagen,et al.  Qu-prolog 4.3 reference manual , 1999 .

[8]  Andrew Philip Martin,et al.  Machine-assisted theorem-proving for software engineering , 1994 .

[9]  Lawrence C. Paulson,et al.  Logic and computation - interactive proof with Cambridge LCF , 1987, Cambridge tracts in theoretical computer science.

[10]  Verónica Dahl,et al.  Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars , 1995, ILPS.

[11]  G. Kreisel The Collected Papers of Gerhard Gentzen , 1971 .

[12]  John Staples,et al.  Higher Level Meta Programming in Qu-Prolog 3: 0 , 1991, ICLP.

[13]  Andrew Martin,et al.  Improving Angel's Parallel Operator: Gumtree's Approach , 1997 .

[14]  David H. D. Warren,et al.  Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks , 1980, Artif. Intell..

[15]  John Staples,et al.  Formalizing a Hierarchical Structure of Practical Mathematical Reasoning , 1993, J. Log. Comput..

[16]  Alan Bundy,et al.  Definite Clause Grammars , 1984 .