Coalgebraic logic programming: from semantics to implementation
Coalgebraic logic programming: from semantics to implementation
Coinductive definitions, such as that of an infinite stream, may often be described by elegant logic programs, but ones for which SLD-refutation is of no value as SLD-derivations fall into infinite loops. Such definitions give rise to questions of lazy corecursive derivations and parallelism, as execution of such logic programs can have both recursive and corecursive features at once. Observational and coalgebraic semantics have been used to study them abstractly. The programming developments have often occurred separately and have usually been implementation-led. Here, we give a coherent semantics-led account of the issues, starting with abstract category theoretic semantics, developing coalgebra to characterize naturally arising trees and proceeding towards implementation of a new dialect, CoALP, of logic programming, characterised by guarded lazy corecursion and parallelism.
coalgebra, coinduction, corecursion, Logic programming, observational semantics, parallelism
745-783
Komendantskaya, Ekaterina
f12d9c23-5589-40b8-bcf9-a04fe9dedf61
Power, John
77e153c6-6a9b-4a7c-aa48-98f6413b86f2
Schmidt, Martin
efe52437-75f3-4757-807f-15c95944f708
28 May 2014
Komendantskaya, Ekaterina
f12d9c23-5589-40b8-bcf9-a04fe9dedf61
Power, John
77e153c6-6a9b-4a7c-aa48-98f6413b86f2
Schmidt, Martin
efe52437-75f3-4757-807f-15c95944f708
Komendantskaya, Ekaterina, Power, John and Schmidt, Martin
(2014)
Coalgebraic logic programming: from semantics to implementation.
Journal of Logic and Computation, 26 (2), .
(doi:10.1093/logcom/exu026).
Abstract
Coinductive definitions, such as that of an infinite stream, may often be described by elegant logic programs, but ones for which SLD-refutation is of no value as SLD-derivations fall into infinite loops. Such definitions give rise to questions of lazy corecursive derivations and parallelism, as execution of such logic programs can have both recursive and corecursive features at once. Observational and coalgebraic semantics have been used to study them abstractly. The programming developments have often occurred separately and have usually been implementation-led. Here, we give a coherent semantics-led account of the issues, starting with abstract category theoretic semantics, developing coalgebra to characterize naturally arising trees and proceeding towards implementation of a new dialect, CoALP, of logic programming, characterised by guarded lazy corecursion and parallelism.
This record has no associated files available for download.
More information
Published date: 28 May 2014
Additional Information:
Publisher Copyright:
© 2014 The Author, 2014. Published by Oxford University Press.
Keywords:
coalgebra, coinduction, corecursion, Logic programming, observational semantics, parallelism
Identifiers
Local EPrints ID: 500423
URI: http://eprints.soton.ac.uk/id/eprint/500423
ISSN: 0955-792X
PURE UUID: 48652500-2228-4bc4-8805-d23a3f4b2fc4
Catalogue record
Date deposited: 29 Apr 2025 16:43
Last modified: 23 May 2025 02:08
Export record
Altmetrics
Contributors
Author:
Ekaterina Komendantskaya
Author:
John Power
Author:
Martin Schmidt
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics