Abstract
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 language | English |
---|---|
Title of host publication | Algebraic Methodology and Software Technology |
Subtitle of host publication | 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers |
Editors | Michael Johnson, Dusko Pavlovic |
Place of Publication | Berlin |
Publisher | Springer |
Pages | 111-127 |
Number of pages | 17 |
ISBN (Electronic) | 9783642177965 |
ISBN (Print) | 9783642177958 |
DOIs | |
Publication status | Published - 2011 |
Event | 13th International Conference on Algebraic Methodology and Software Technology - Lac Beauport, Canada Duration: 23 Jun 2010 → 25 Jun 2010 http://mpc-amast2010.fsg.ulaval.ca/amast/ |
Publication series
Name | Lecture notes in computer science |
---|---|
Publisher | Springer |
Volume | 6486 |
Conference
Conference | 13th International Conference on Algebraic Methodology and Software Technology |
---|---|
Abbreviated title | AMAST2010 |
Country/Territory | Canada |
City | Lac Beauport |
Period | 23/06/10 → 25/06/10 |
Internet address |
Keywords
- Logic programming
- SLD-resolution
- Parallel Logic programming
- Coalgebra
- Coinduction