Logical closures

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Uniform proof procedures for hereditary Harrop formulae have been proposed as a foundation for logic programming. A non-standard approach to defining hereditary Harrop formula is given, allowing quantification over predicate variables but distinguishing the forms of predicate quantification. The benefits of this approach include a treatment of higher order procedures which avoids some scoping problems with languages such as λ-Prolog, and the possibility of extending the language straightforwardly with a module system such as that developed for Standard ML. To enable a style of programming found in existing logic programming languages, a form of implementation inheritance is introduced into the language. Combining this with explicit type quantification provides a form of dynamic dispatching similar to CLOS generic procedures in a statically typed language.

Original languageEnglish
Title of host publicationLogic Programming and Automated Reasoning - 5th International Conference, LPAR 1994, Proceedings
EditorsFrank Pfenning
Pages114-128
Number of pages15
DOIs
StatePublished - 1994
Event5th International Conferenceon Logic Programming and Automated Reasoning, LPAR 1994 - Kiev, Ukraine
Duration: 16 Jul 199422 Jul 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume822 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conferenceon Logic Programming and Automated Reasoning, LPAR 1994
Country/TerritoryUkraine
CityKiev
Period16/07/9422/07/94

Fingerprint

Dive into the research topics of 'Logical closures'. Together they form a unique fingerprint.

Cite this