18 search results - page 4 / 4 » Termination of narrowing via termination of rewriting |
TISSEC
2002
13 years 5 months ago
2002
Language runtime systems are increasingly being embedded in systems to support runtime extensibility via mobile code. Such systems raise a number of concerns when the code running...
PPDP
2007
Springer
14 years 3 days ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
CSL
2007
Springer
14 years 5 days ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...