ELAN from a rewriting logic point of view
From MaRDI portal
Publication:1608914
DOI10.1016/S0304-3975(01)00358-9zbMath1001.68057MaRDI QIDQ1608914
Hélène Kirchner, Claude Kirchner, Pierre-Etienne Moreau, Peter Borovanský
Publication date: 13 August 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
rule-based programming; computational system; conditional rewriting logic; rewriting calculus; strategy theory
Related Items
Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic, A rewriting logic framework for operational semantics of membrane systems, Rewriting logic: Roadmap and bibliography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of matching problems
- A technical note on AC-unification. The number of minimal unifiers of the equation \(\alpha x_ 1+ \cdots + \alpha x_ p \doteq _{AC} \beta y_ 1+ \cdots + \beta y_ q\)
- Conditional rewriting logic as a unified model of concurrency
- Automated deduction with associative-commutative operators
- Theorem proving modulo
- Autarkic computations in formal proofs
- Edinburgh LCF. A mechanized logic of computation
- Tree automata help one to solve equational formulae in AC-theories
- Basic paramodulation
- Induction for termination with local strategies
- Completion of a Set of Rules Modulo a Set of Equations
- Complete Sets of Reductions for Some Equational Theories
- The B-Book
- Proving innermost normalisation automatically
- Prototyping combination of unification algorithms with the ELAN rule-based programming language
- Associative-commutative discrimination nets
- On proving termination by innermost termination
- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
