Komendantskaya, E., McCusker, G. and Power, J., 2011. Coalgebraic semantics for parallel derivation strategies in logic programming. Springer, pp. 111-127. (Lecture Notes in Computer Science)
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.
|Item Type ||Conference or Workshop Items (UNSPECIFIED)|
|Creators||Komendantskaya, E., McCusker, G. and Power, J.|
|Editors||Johnson, M.and Pavlovic, D.|
|Departments||Faculty of Science > Computer Science|
|Publisher Statement||AMAST-KMP10.pdf: The original publication is available at www.springerlink.com|
Actions (login required)