Equivalence of two fixed-point semantics for definitional higher-order logic programs

Two distinct research approaches have been proposed for assigning extensional semantics to higher-order logic programming. The former approach [11] uses classical domain-theoretic tools while the latter [1] builds on a fixed-point construction defined on a syntactic instantiation of the source progr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 668; S. 27 - 42
Hauptverfasser:	Charalambidis, Angelos, Rondogiannis, Panos, Symeonidou, Ioanna
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 15.03.2017
Schlagworte:	Extensional higher-order logic programming Semantics of logic programming Extensional higher-order logic programming Semantics of logic programming
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!