How to replace failure by a list of successes
Proc. of a conference on Functional programming languages and computer architecture
CADiZ : an architecture for Z tools and its implementation
Software—Practice & Experience
Haskell: the craft of functional programming
Haskell: the craft of functional programming
Mural: A Formal Development Support System
Mural: A Formal Development Support System
Innovations in the Notation of Standard Z
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
On Mutually Recursive Free Types in Z
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
CONVERSE: a family-oriented software development process for engine controllers
Systems engineering for business process change
Improving the usability of HOL through controlled automation tactics
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Proving properties of stateflow models using ISO standard z and CADiZ
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
| Hi-index | 0.00 |
The syntax and semantics of a particular tactic language are defined. The language uses lazy evaluation to manage backtracking in the search space. It also uses pattern matching to associate names with formulae that will subsequently be passed as arguments to an inference rule. The result of the inference rule is accompanied by a revision of the association, so that corresponding formulae in the result may be passed as arguments to the next inference rule. The combination of this revision with lazy evaluation raises some problems for efficient implementation.