Oxford Journals
tools journals homepage advanced search contact help
Journal of Logic and Computation: Current Issue
 
home
browse
current
etoc
authors
subinfo
subscribers
samples

OUP > Journals > Computing/Engineer. & Mathematics/Stats. > Journal of Logic and Computation

Journal of Logic and Computation

Volume 12, Issue 5, October 2002: pp. 747-771

Lazy List Comprehension in Logic Programming

Birgit Elbl1

1Fakultät für Informatik, UniBw München, 85577 Neubiberg, Germany. E-mail: birgit@informatik.unibw-muenchen.de

The pure prolog evaluation of a goal yields a list of answers, but the tools provided for manipulating these structures are very poor. We discuss augmenting pure prolog with a list comprehension construct that offers the possibility of referring to the finite or infinite list of answers produced. Thus meta-predicates can be defined. A substructural calculus is used to give an axiomatic semantics to the extended language. Soundness and completeness of the intended evaluation with respect to this semantics is proved.

Keywords: Logic programming; lazy list comprehension; axiomatic semantics

Table of Contents   Full-Text PDF (262 KB)

Oxford University Press
Published by Oxford University Press
Copyright ©Oxford University Press 2003
Print ISSN: 0955-792X  Online ISSN: 1465-363X.
Oxford University Press Privacy Policy and Legal Statement