MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  The Light Lexicographic path Ordering

Download:
Download as a PDF | Download as a PS
by E. A. Cichon, J-y. Marion
http://www.loria.fr/~marionjy/Papers/llpo.ps
Add To MetaCart

Abstract:

We introduce syntactic restrictions of the lexicographic path ordering to obtain the Light Lexicographic Path Ordering. We show that the light lexicographic path ordering leads to a characterisation of the functions computable in space bounded by a polynomial in the size of the inputs. 1

Citations

162 Proving Termination with Multiset Ordering – Dershowitz, Manna - 1979
146 A new recursion-theoretic characterization of the poly-time functions – Bellantoni, Cook - 1992
49 Predicative recurrence and computational complexity I: Word recurrence and poly-time – Leivant - 1994
24 On the termination of Markov algorithms – Manna, Ness - 1970
17 Ramified Recurrence and Computational Complexity II: Substitution and Poly-space – Leivant, Marion - 1995
11 Termination proofs by multiset path orderings imply primitive recursive derivation lengths – HOFBAUER - 1992
7 A note on simpli orderings – Dershowitz - 1979
6 Attempts for generalising the recursive path orderings – Kamin, Lévy - 1980
5 A recursively de ordering for proving termination of term rewriting systems – Plaisted - 1978
4 Predicative functional recurrence and poly-space – Leivant, Marion - 1997
2 A characterization of alternating log time by rami recurrence – Leivant, Marion - 2000
2 Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths – Weiermann - 1995
1 Functions over free algebras de in the simply typed lambda calculus – Leivant - 1993
1 Light muliset path ordering - two is better than one. ICC Workshop aliated to LICS – Marion - 1999
View or Download | Add to My Collection | Correct Errors