A denotational semantics and dataflow construction for logic programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3837349 (Why is no real title available?)
- scientific article; zbMATH DE number 177828 (Why is no real title available?)
- scientific article; zbMATH DE number 3469994 (Why is no real title available?)
- A deterministic prolog fixpoint semantics
- Axiomatizations of backtracking
- Contributions to the Theory of Logic Programming
- Declarative modeling of the operational behavior of logic languages
- Lucid—A Formal System for Writing and Proving Programs
- Properties of substitutions and unifications
- Recursion equation sets computing logic programs
- Simple operational and denotational semantics for Prolog with cut
Cited in
(9)- A generic algebra for data collections based on constructive logic
- Bottom-up dataflow analysis of normal logic programs
- Efficient dataflow analysis of logic programs
- scientific article; zbMATH DE number 4064537 (Why is no real title available?)
- scientific article; zbMATH DE number 3965412 (Why is no real title available?)
- Transformation of logic programs to FP programs based on dataflows
- Defining Datalog in Rewriting Logic
- Denotation by Transformation
- scientific article; zbMATH DE number 3949749 (Why is no real title available?)
This page was built for publication: A denotational semantics and dataflow construction for logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318723)