Coalgebraic semantics for parallel derivation strategies in logic programming

Ekaterina Komendantskaya, Guy McCusker, John Power

Research output: Chapter or section in a book/report/conference proceedingChapter or section

14 Citations (SciVal)
200 Downloads (Pure)


Logic programming, a class of programming languages based on first-order logic, provides simple and efficient tools for goal-oriented proof-search. Logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either P f P f -coalgebras or P f List-coalgebras on Set. We analyse different kinds of derivation strategies and derivation trees (proof-trees, SLD-trees, and-or parallel trees) used in logic programming, and show how they can be modelled coalgebraically.
Original languageEnglish
Title of host publicationAlgebraic Methodology and Software Technology
EditorsMichael Johnson, Dusko Pavlovic
Number of pages17
ISBN (Print)978-3-642-17795-8
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag


Dive into the research topics of 'Coalgebraic semantics for parallel derivation strategies in logic programming'. Together they form a unique fingerprint.

Cite this