scholarly journals A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting

10.29007/cpt8 ◽  
2018 ◽  
Author(s):  
Marco Comini ◽  
Luca Torella

In this paper we present a novel condensed narrowing-like semantics that contains the minimal information which is needed to describe compositionally all possible rewritings of a term rewriting system. We provide its goal-dependent top-down definition and, more importantly, an equivalent goal-independent bottom-up fixpoint characterization.We prove soundness and completeness w.r.t. the small-step behavior of rewriting for the full class of term rewriting systems.

1990 ◽  
Vol 13 (2) ◽  
pp. 211-226
Author(s):  
Z. Fülop ◽  
S. Vágvölgyi

The concept of top-down tree automata with prefix look-ahead is introduced. It is shown that a tree language is the set of irreducible trees of a left-linear term rewriting system if and only if it can be recognized by a one-state deterministic top-down tree automaton with pre fix look-ahead.


2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE

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