Sciweavers

37 search results - page 3 / 8
» Partial Inversion of Constructor Term Rewriting Systems
Sort
View
ENTCS
2002
108views more  ENTCS 2002»
13 years 6 months ago
Rewriting in the partial algebra of typed terms modulo AC
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
Thomas Colcombet
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
13 years 10 months ago
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
Salvador Lucas
MFCS
1997
Springer
13 years 10 months ago
When are Two Rewrite Systems More than None?
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
Nachum Dershowitz
CADE
2012
Springer
11 years 8 months ago
Rewriting Induction + Linear Arithmetic = Decision Procedure
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
Stephan Falke, Deepak Kapur
RTA
2009
Springer
14 years 29 days ago
A Heterogeneous Pushout Approach to Term-Graph Transformation
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...
Dominique Duval, Rachid Echahed, Fréd&eacut...