Pages that link to "Item:Q5179140"
From MaRDI portal
The following pages link to Operational Termination of Membership Equational Programs: the Order-Sorted Way (Q5179140):
Displaying 12 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Methods for Proving Termination of Rewriting-based Programming Languages by Transformation (Q2808239) (← links)
- Use of Logical Models for Proving Operational Termination in General Logics (Q2827835) (← links)
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← links)
- The Formal System of Dijkstra and Scholten (Q2945729) (← links)
- MTT: The Maude Termination Tool (System Description) (Q3541712) (← links)
- Termination Modulo Combinations of Equational Theories (Q3655204) (← links)
