The following pages link to (Q3979263):
Displayed 4 items.
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- Decidable call by need computations in term rewriting (extended abstract) (Q5234682) (← links)