Closures and fairness in the semantics of programming logic (Q799098): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Closures and fairness in the semantics of programming logic |
scientific article |
Statements
Closures and fairness in the semantics of programming logic (English)
0 references
1984
0 references
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)].
0 references
SLD resolution
0 references
logic programs
0 references
fixed point theorems
0 references
denotational semantics
0 references
