Sciweavers

7 search results - page 2 / 2
» wflp 2009
Sort
View
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
13 years 11 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
13 years 11 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...