(Co)recursion in Logic Programming: Lazy vs Eager
Authors: Jónathan Heras, Ekaterina Komendantskaya and Martin Schmidt
Paper Information
| Title: | (Co)recursion in Logic Programming: Lazy vs Eager |
| Authors: | Jónathan Heras, Ekaterina Komendantskaya and Martin Schmidt |
| Proceedings: | ICLP 2014 VSL proceedings |
| Editors: | Michael Leuschel, Tom Schrijvers and Martin Gebser |
| Keywords: | Lazy Languages, Eager Languages, Corecursion, Termination, Guardedness, Loop Detection |
| Abstract: | ABSTRACT. Coalgebraic Logic Programming (CoALP) is a dialect of Logic programming designed to work with coinductive definitions of infinite objects. Its main goal is to introduce guarded lazy corecursion akin functional theorem provers into logic programming. In this paper, we give the first full formal account of guarded corecursion in CoALP, and present its implementation. |
| Pages: | 10 |
| Talk: | Jul 21 11:45 |
| Paper: |  |