Lazy List Comprehension in Logic Programming

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 metadpredicates 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.