论文信息 - A tactic calculus — abridged version

A tactic calculus — abridged version

We present a very general language for expressing tactic programs. The paper describes some essential tactic combinators (tacticals), and gives them a formal semantics. Those definitions are used to produce a complete calculus for reasoning about tactics written in this language. The language is extended to coverstructural combinators which enable the tactics to be precisely targeted upon particular sub-expressions.

Jim Woodcock | Andrew P. Martin | Paul H. B. Gardiner | J. Woodcock | Andrew P. Martin

[1] Jim Woodcock,et al. A Tactic Calculus - Full version , 1996 .

[2] David A. Schmidt. A Programming Notation for Tactical Reasoning , 1984, CADE.

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

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

[5] Andrew Martin,et al. A Tactic Calculus , 1996 .

[6] Philip Wadler,et al. Packrat parsing:: simple, powerful, lazy, linear time, functional pearl , 2002, ICFP '02.

[7] Amy P. Felty,et al. Implementing tactics and tacticals in a higher-order logic programming language , 1993, Journal of Automated Reasoning.

[8] Richard S. Bird,et al. Lectures on Constructive Functional Programming , 1989 .

[9] Lawrence Charles Paulson,et al. ML for the working programmer , 1991 .

[10] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .