Pages that link to "Item:Q1899138"
From MaRDI portal
The following pages link to A mathematical definition of full Prolog (Q1899138):
Displaying 15 items.
- Towards proving type safety of .NET CIL (Q941469) (← links)
- Towards proving type safety of \(\mathrm{C}^{\#}\) (Q1749247) (← links)
- Abstract state machines: a unifying view of models of computation and of system design frameworks (Q1772776) (← links)
- First-order theories for pure Prolog programs with negation (Q1892097) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- Toward the concept of backtracking computation (Q2848128) (← links)
- Neutralizing Semantic Ambiguities of Function Block Architecture by Modeling with ASM (Q3455059) (← links)
- Ibn Sīnā on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic (Q3586011) (← links)
- A logical operational semantics of full Prolog. History of ideas (Q3976572) (← links)
- (Q4725709) (← links)
- A transformation of propositional Prolog programs into classical logic (Q5101458) (← links)
- PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION (Q5249252) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- \textsf{lean}\textit{EA}: a lean evolving algebra compiler (Q6560162) (← links)
