Making Control and Data Flow in Logic Programs Explicit

@inproceedings{Smolka1984MakingCA,
  title={Making Control and Data Flow in Logic Programs Explicit},
  author={Gert Smolka},
  booktitle={LISP and Functional Programming},
  year={1984}
}
New control constructs are proposed to replace Prolog's notorious cut. Totality assertions are introduced to enable a language-oriented editor to display the control structure of a procedure. Functional notation is presented as a syntactic extension. Data flow assertions are proposed to assert data flow properties and restrictions of logic procedures. Algorithms for their verification are given. 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS