Elsevier

Theoretical Computer Science

Volume 136, Issue 1, 19 December 1994, Pages 277-289
Theoretical Computer Science

A semantics for λProlog

https://doi.org/10.1016/0304-3975(93)00130-WGet rights and content
Under an Elsevier user license
open archive

Abstract

We give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of a form of the λProlog higher-order logic programming language. We define certain intensional general models and show that higher-order Horn clause logic is sound and complete with respect to them.

Cited by (0)