Closures and fairness in the semantics of programming logic (Q799098)
From MaRDI portal
scientific article
In more languages
ConfigureLanguage | Label | Description | Also known as |
---|---|---|---|
English | Closures and fairness in the semantics of programming logic |
scientific article |
Statements
Using the techniques of closures and chaotic iterations of P. Cousot and R. Cousot, the authors give a semantics to logic programs and then study some fixed point theorems, denotational semantics and the like. The final section is devoted to an extension of the characterization of SLD finite failure given by \textit{K. R. Apt} and \textit{M. H. van Emden} [J. Assoc. Comput. Mach. 29, 841-862 (1982; Zbl 0483.68004)].