Sciweavers

94 search results - page 7 / 19
» Confluence of Conditional Rewrite Systems
Sort
View
108
Voted
CTRS
1992
15 years 4 months ago
Decidability of Regularity and Related Properties of Ground Normal Form Languages
ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1
Gregory Kucherov, Mohamed Tajine
201
Voted
POPL
2003
ACM
16 years 23 days ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
130
Voted
MCMASTER
1993
15 years 4 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
ACTA
2005
101views more  ACTA 2005»
15 years 11 days ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
118
Voted
CSMR
2004
IEEE
15 years 4 months ago
Rewrite Systems for Symbolic Evaluation of C-like Preprocessing
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
Mario Latendresse