A semantics for Prolog
From MaRDI portal
A semantics for \(\lambda \)Prolog
Recommendations
Cites work
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- scientific article; zbMATH DE number 3999882 (Why is no real title available?)
- scientific article; zbMATH DE number 3222098 (Why is no real title available?)
- scientific article; zbMATH DE number 3085191 (Why is no real title available?)
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- A proof of cut-elimination theorem in simple type-theory
- A unification algorithm for typed \(\overline\lambda\)-calculus
- Completeness in the theory of types
- Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
- General models and extensionality
- Hauptsatz for higher order logic
- Higher-order Horn clauses
- Kripke-style models for typed lambda calculus
- Proof theory
- Resolution in type theory
- Syntactical and semantical properties of simple type theory
- The Semantics of Predicate Logic as a Programming Language
- Uniform proofs as a foundation for logic programming
Cited in
(10)- Higher-order Horn clauses
- scientific article; zbMATH DE number 2085244 (Why is no real title available?)
- Abstract deduction and inferential models for type theory
- Theory of logic programming. An elementary introduction
- Kripke semantics for higher-order type theory applied to constraint logic programming languages
- Higher-Order Logic Programming Languages with Constraints: A Semantics
- A structured alternative to Prolog with simple compositional semantics
- scientific article; zbMATH DE number 3992920 (Why is no real title available?)
- A semantics for nabla
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
This page was built for publication: A semantics for \(\lambda \)Prolog
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349686)
