Closures and fairness in the semantics of programming logic
DOI10.1016/0304-3975(84)90017-3zbMATH Open0547.68034OpenAlexW2092054572WikidataQ127526099 ScholiaQ127526099MaRDI QIDQ799098FDOQ799098
Michael J. Maher, Jean-Louis Lassez
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90017-3
Recommendations
General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Cites Work
- Constructive versions of Tarski's fixed point theorems
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- The Semantics of Predicate Logic as a Programming Language
- A Machine-Oriented Logic Based on the Resolution Principle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Contributions to the Theory of Logic Programming
- Title not available (Why is that?)
- Closures and fairness in the semantics of programming logic
- Title not available (Why is that?)
Cited In (28)
- Closures and fairness in the semantics of programming logic
- Semantics of infinite tree logic programming
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
- Unfold/fold transformation of stratified programs
- Why a single parallelization strategy is not enough in knowledge bases
- Optimal fixedpoints of logic programs
- Contributions to the semantics of logic perpetual processes
- Semantics of distributed definite clause programs
- Weak generalized closed world assumption
- Paraconsistent logic programming
- A semantics for modular general logic programs
- \(\exists\)-Universal termination of logic programs
- The fixed points of logic programs with Herbrand base \({\mathbb{N}}\)
- A compositional semantics for logic programs
- Title not available (Why is that?)
- Sémantique logique et dénotationnelle des interpréteurs PROLOG
- S-semantics for logic programming: a retrospective look
- Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
- Efficient analysis of concurrent constraint logic programs
- Negation in rule-based database languages: A survey
- Conditional equational theories and complete sets of transformations
- Recursion equation sets computing logic programs
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
- Definite clause programs are canonical (over a suitable domain)
- Is there an axiomatic semantics for standard pure Prolog?
- Maximal unifiable subsets and minimal non-unifiable subsets
- Complete extension of general logic programs
- Fully abstract compositional semantics for an algebra of logic programs
This page was built for publication: Closures and fairness in the semantics of programming logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799098)
