The following pages link to Term Rewriting and Applications (Q5703856):
Displaying 10 items.
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Narrowing-based simulation of term rewriting systems with extra variables and its termination proof (Q2844056) (← links)
- Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
- (Q4847002) (← links)
- Variant Narrowing and Equational Unification (Q5179131) (← links)
- Functional and Logic Programming (Q5308019) (← links)
- Functional Logic Programming in Maude (Q5403075) (← links)
- An optimal narrowing strategy for general canonical systems (Q5881212) (← links)