A denotational semantics and dataflow construction for logic programs

DOI10.1016/0304-3975(94)90054-XzbMath0795.68036OpenAlexW2012685037MaRDI QIDQ1318723

Susumu Yamasaki

Publication date: 5 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90054-x

zbMATH Keywords

denotational semanticslogic programdataflow

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple operational and denotational semantics for Prolog with cut
• Declarative modeling of the operational behavior of logic languages
• Recursion equation sets computing logic programs
• Properties of substitutions and unifications
• A deterministic prolog fixpoint semantics
• Contributions to the Theory of Logic Programming
• Lucid—A Formal System for Writing and Proving Programs
• Axiomatizations of backtracking

This page was built for publication: A denotational semantics and dataflow construction for logic programs