Dependency Pairs for Simply Typed Term Rewriting

2005 ◽  
pp. 120-134 ◽  
Author(s):  
Takahito Aoto ◽  
Toshiyuki Yamada
Keyword(s):  
Term Rewriting ◽  
Dependency Pairs

scholarly journals Termination of term rewriting using dependency pairs

2000 ◽  
Vol 236 (1-2) ◽  
pp. 133-178 ◽  
Author(s):  
Thomas Arts ◽  
Jürgen Giesl
Keyword(s):  
Term Rewriting ◽  
Dependency Pairs

scholarly journals Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs

2013 ◽  
Vol 51 (1) ◽  
pp. 27-56 ◽  
Author(s):  
Lars Noschinski ◽  
Fabian Emmes ◽  
Jürgen Giesl
Keyword(s):  
Term Rewriting ◽  
Dependency Pairs

scholarly journals Semantics and strong sequentiality of priority term rewriting systems

1998 ◽  
Vol 208 (1-2) ◽  
pp. 87-110 ◽  
Author(s):  
Masahiko Sakai ◽  
Yoshihito Toyama
Keyword(s):  
Term Rewriting ◽  
Term Rewriting Systems ◽  
Rewriting Systems

PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE
Keyword(s):  
Programming Languages ◽  
Pattern Matching ◽  
Term Rewriting ◽  
Directed Acyclic Graphs ◽  
Tree Automaton ◽  
Minimal Tree ◽  
Term Rewriting Systems ◽  
Rewriting Systems ◽  
Acyclic Graphs ◽  
Space Requirements

We compile pattern matching for overlapping patterns in term rewriting systems into a minimal, tree matching automata. The use of directed acyclic graphs that shares all the isomorphic subautomata allows us to reduce space requirements. These are duplicated in the tree automaton. We design an efficient method to identify such subautomata and avoid duplicating their construction while generating the dag automaton. We compute some bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton.

Sign in / Sign up

Export Citation Format

Share Document