Properties of Input-Consuming Derivations
Programming Languages
2007-05-23 v1 Logic in Computer Science
Abstract
We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations can be used to model the behavior of logic programs using dynamic scheduling and employing constructs such as delay declarations. We consider the class of nicely-moded programs and queries. We show that for these programs a weak version of the well-known switching lemma holds also for input-consuming derivations. Furthermore, we show that, under suitable conditions, there exists an algebraic characterization of termination of input-consuming derivations.
Cite
@article{arxiv.cs/0101023,
title = {Properties of Input-Consuming Derivations},
author = {Annalisa Bossi and Sandro Etalle and Sabina Rossi},
journal= {arXiv preprint arXiv:cs/0101023},
year = {2007}
}
Comments
33 pages