Back to search

National and Kapodistrian University of Athens

Prοοf procedure for extensional higher-order logic programming

Abstract

dc:description

We consider an extensional higher-order logic programming language which possesses the minimum Herbrand model property. We propose an SLD-resolution proof procedure and we demonstrate that it is sound and complete with respect to this semantics. In this way, we extend the familiar proof theory of first-order logic programming to apply to the more general higher-order case. We then enhance our source language with constructive negation and extend the aforementioned proof procedure to support this new feature. We demonstrate the soundness of the resulting proof procedure and describe an actual implementation of a language that embodies the above ideas.

Degree

thesis:*
Grantor dc:publisher
National and Kapodistrian University of Athens
Year dc:date
2014

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Charalambidis, Angelos
  • Χαραλαμπίδης, Άγγελος

Subjects

dc:subject × 14

Rights

Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/38099

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Charalambidis, Angelos; Χαραλαμπίδης, Άγγελος. Prοοf procedure for extensional higher-order logic programming. National and Kapodistrian University of Athens, 2014. http://hdl.handle.net/10442/hedi/38099