Simple operational and denotational semantics for Prolog with cut
From MaRDI portal
Publication:912643
DOI10.1016/0304-3975(90)90197-PzbMATH Open0698.68069MaRDI QIDQ912643FDOQ912643
Authors: Michel Billaud 
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (19)
- A prescribed cut for Prolog that ensures soundness
- Backtracking with cut via a distributive law and left-zero monoids
- A logical semantics for depth-first Prolog with ground negation
- An operational formal definition of PROLOG: A specification method and its application
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Denotational and operational semantics for prolog
- Operational and denotational semantics of prolog
- Title not available (Why is that?)
- A denotational semantics and dataflow construction for logic programs
- Prolog's control constructs in a functional setting -- axioms and implementation
- The witness properties and the semantics of the Prolog cut
- Operational and goal-independent denotational semantics for Prolog with cut
- A non-definability result for a predicational language with the usual control
- Proving completeness of logic programs with the cut
- Is there an axiomatic semantics for standard pure Prolog?
- Axiomatizations of backtracking
- Comparative semantics for prolog with cut
This page was built for publication: Simple operational and denotational semantics for Prolog with cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912643)
