Pages that link to "Item:Q912643"
From MaRDI portal
The following pages link to Simple operational and denotational semantics for Prolog with cut (Q912643):
Displaying 14 items.
- Proving completeness of logic programs with the cut (Q511027) (← links)
- Is there an axiomatic semantics for standard pure Prolog? (Q805224) (← links)
- Two congruent semantics for Prolog with CUT (Q805227) (← links)
- Comparative semantics for flow of control in logic programming without logic (Q805247) (← links)
- Comparative semantics for prolog with cut (Q920622) (← links)
- An operational formal definition of PROLOG: A specification method and its application (Q1186100) (← links)
- Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator (Q1274764) (← links)
- A denotational semantics and dataflow construction for logic programs (Q1318723) (← links)
- A logical semantics for depth-first Prolog with ground negation (Q1390936) (← links)
- Operational and denotational semantics of prolog (Q3768369) (← links)
- (Q4010351) (← links)
- Axiomatizations of backtracking (Q5096771) (← links)
- PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION (Q5249252) (← links)
- Backtracking with cut via a distributive law and left-zero monoids (Q5372012) (← links)