Pages that link to "Item:Q5055854"
From MaRDI portal
The following pages link to On proving termination by innermost termination (Q5055854):
Displaying 11 items.
- Some characteristics of strong innermost normalization (Q1575274) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Termination Proofs for Recursive Functions in FoCaLiZe (Q2814388) (← links)
- (Q4016542) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
- Term Rewriting and Applications (Q5703859) (← links)
- Term Rewriting and Applications (Q5703865) (← links)
- Theoretical Aspects of Computing - ICTAC 2004 (Q5709986) (← links)