Pages that link to "Item:Q1093366"
From MaRDI portal
The following pages link to A refinement of strong sequentiality for term rewriting with constructors (Q1093366):
Displaying 12 items.
- Constructor equivalent term rewriting systems (Q689634) (← links)
- Implementing first-order rewriting with constructor systems (Q1112601) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- Sequentiality in orthogonal term rewriting systems (Q1186735) (← links)
- Semantics and strong sequentiality of priority term rewriting systems (Q1275017) (← links)
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof (Q1338780) (← links)
- Bounded, strongly sequential and forward-branching term rewriting systems (Q1892142) (← links)
- Compact normalisation trace via lazy rewriting (Q2841224) (← links)
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution (Q5055735) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Optimal normalization in orthogonal term rewriting systems (Q5055799) (← links)
- Semantics and strong sequentially of priority term rewriting systems (Q5055874) (← links)