Download:
|
by Horatiu Cirstea, Claude Kirchner
in Arithmetic, Proof Theory and Computational Complexity, P. Clote and
http://www.loria.fr/~cirstea/Papers/StrategiesB-99-R-249.ps.gz
Add To MetaCart
Abstract:
Rules controlled by strategies is the main paradigm of the language ELAN that we are using here as a logical framework to describe the propositional and predicate prover of the B system. The inference rules for the provers are described by conditional rewrite rules and their application is controlled by strategies. We show how dierent strategies using the same set of rewrite rules lead to dierent proof methods and how this could be nely controlled by the user. 1
Citations
|
1463
|
The definition of Standard ML
– Milner, Tofte, et al.
- 1990
|
|
368
|
Conditional rewriting logic as a unified model of concurrency
– Meseguer
- 1992
|
|
168
|
Solving equations in abstract algebras: a rule-based survey of unification
– Jouannaud, Kirchner
- 1991
|
|
151
|
General logics
– Meseguer
- 1989
|
|
134
|
Rewriting logic as a logical and semantic framework
– Oliet, Meseguer
- 1993
|
|
125
|
The B-Book
– Abrial
- 1996
|
|
124
|
Principles of Maude
– Clavel, Eker, et al.
- 1996
|
|
77
|
An Overview of ELAN
– Borovansk´y, Kirchner, et al.
|
|
63
|
Designing constraint logic programming languages using computational systems
– Kirchner, Kirchner, et al.
- 1995
|
|
54
|
Conditional rewriting logic as a uni model of concurrency
– Meseguer
- 1992
|
|
52
|
Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems
– Dershowitz, Jouannaud
- 1990
|
|
25
|
Theorem proving modulo, Rapport de Recherche INRIA 3400
– Hardin, Kirchner
- 1998
|
|
17
|
A functional view of rewriting and strategies for a semantics of ELAN
– Borovansk'y, Kirchner, et al.
- 1998
|
|
10
|
contr^ole de la reecriture: etude et implantation d'un formalisme de strategies. These de Doctorat d'Universite, Universite Henri Poincare { Nancy 1
– Le
- 1998
|
|
9
|
Combining higher-order and computation using -calculus: Towards a semantics of ELAN
– Cirstea, Kirchner
- 1999
|
|
8
|
Combining decision algorithms for matching in the union of disjoint equational theories
– Ringeissen
- 1996
|
|
5
|
Theorem proving using computational systems: The case of the B predicate prover
– Cirstea, Kirchner
- 1997
|
|
5
|
Combination of matching algorithms
– Ringeissen
- 1994
|
|
4
|
An introduction to the rewriting calculus. Rapport de recherche
– Cirstea, Kirchner
- 1999
|
|
4
|
An Overview of CAFE Speci Environment { An algebraic approach for creating, verifying, and maintaining formal speci over networks
– Futatsugi, Nakagawa
- 1997
|
|
3
|
An Overview of ASF+SDF
– Deursen
- 1996
|
|
2
|
Le prouveur de predicat
– Abrial
- 1997
|
