Exceptions in the Rewriting Calculus

Authors:
Germain Faure;Claude Kirchner
Affiliations:
-;-
Venue:
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Year:
2002

Citing 4
Cited 4

A rationale for conditional equational programming

Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Experience with Embedding Hardware Description Languages in HOL

Proceedings of the IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience
The Rho Cube

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Matching Power

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications

Pure patterns type systems

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Expressing combinatory reduction systems derivations in the rewriting calculus

Higher-Order and Symbolic Computation
A ρ-calculus of explicit constraint application

Higher-Order and Symbolic Computation
A ρ-Calculus of Explicit Constraint Application

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the context of the rewriting calculus, we introduce and study an exception mechanism that allows us to express in a simple way rewriting strategies and that is therefore also useful for expressing theorem proving tactics. The proposed exception mechanism is expressed in a confluent calculus which gives the ability to simply express the semantics of the first tactical and to describe in full details the expression of conditional rewriting.