Closures and fairness in the semantics of programming logic
Open Access
- 31 December 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 29 (1-2) , 167-184
- https://doi.org/10.1016/0304-3975(84)90017-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- Constructive versions of Tarski’s fixed point theoremsPacific Journal of Mathematics, 1979
- Automatic synthesis of optimal invariant assertionsACM SIGPLAN Notices, 1977
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955