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...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 668; pp. 27 - 42
Main Authors:	Charalambidis, Angelos, Rondogiannis, Panos, Symeonidou, Ioanna
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.03.2017
Subjects:	Extensional higher-order logic programming Semantics of logic programming Extensional higher-order logic programming Semantics of logic programming
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!