The Light Lexicographic path Ordering
Programming Languages
2007-05-23 v1 Computational Complexity
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.
Cite
@article{arxiv.cs/0010008,
title = {The Light Lexicographic path Ordering},
author = {E. A. Cichon and J-Y. Marion},
journal= {arXiv preprint arXiv:cs/0010008},
year = {2007}
}