A semantics for \(\lambda \)Prolog
type: Item
instance of: scholarly article
title: A semantics for \(\lambda \)Prolog
zbMATH Open document ID: 0874.68181
DOI: 10.1016/0304-3975(93)00130-W
author: D. A. Wolfram
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 983733
describes a project that uses: ETPS
MaRDI profile type: Publication
cites work: Resolution in type theory
cites work: General models and extensionality
cites work: Q4726218
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
cites work: Completeness in the theory of types
cites work: A unification algorithm for typed \(\overline\lambda\)-calculus
cites work: Q5509675
cites work: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
cites work: Uniform proofs as a foundation for logic programming
cites work: Kripke-style models for typed lambda calculus
cites work: Higher-order Horn clauses
cites work: Hauptsatz for higher order logic
cites work: Syntactical and semantical properties of simple type theory
cites work: Q4143279
cites work: A proof of cut-elimination theorem in simple type-theory
cites work: Q5822068
cites work: Proof theory
full work available at URL: 0304-3975(93)00130-w
OpenAlex ID: W2022937548
description: scientific article; zbMATH DE number 983733