The Light Lexicographic path Ordering

TL;DR

The paper introduces the Light Lexicographic Path Ordering, a syntactic restriction that characterizes functions computable within polynomial space, providing a new tool for analyzing computational complexity.

Contribution

It proposes the Light Lexicographic Path Ordering, a novel restriction of the lexicographic path ordering, to characterize polynomial space computable functions.

Findings

Characterizes polynomial space computable functions

Defines the Light Lexicographic Path Ordering

Provides a syntactic restriction of the lexicographic path ordering

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.