G. Amato, J. Lipton, and R. Mcgrail, On the algebraic structure of declarative programming languages, Theoretical Computer Science, vol.410, issue.46, p.41046264671, 2009.
DOI : 10.1016/j.tcs.2009.07.038

J. Benabou, Introduction to bicategories, Lecture Notes in Mathematics, vol.7, pp.1-77, 1967.
DOI : 10.1007/BF01451367

R. Blackwell, G. M. Kelly, and A. J. Power, Two-dimensional monad theory, Journal of Pure and Applied Algebra, vol.59, issue.1, pp.1-41, 1989.
DOI : 10.1016/0022-4049(89)90160-6
URL : http://doi.org/10.1016/0022-4049(89)90160-6

F. Bonchi and U. Montanari, Reactive systems, (semi-)saturated semantics and coalgebras on presheaves, Theoretical Computer Science, vol.410, issue.41, p.41040444066, 2009.
DOI : 10.1016/j.tcs.2009.06.010
URL : http://doi.org/10.1016/j.tcs.2009.06.010

R. Bruni, U. Montanari, and F. Rossi, An interactive semantics of logic programming, Theory and Practice of Logic Programming, vol.1, issue.06, p.647690, 2001.
DOI : 10.1017/S1471068401000035

F. Bonchi and F. Zanasi, Saturated Semantics for Coalgebraic Logic Programming, CALCO, p.8094, 2013.
DOI : 10.1007/978-3-642-40206-7_8
URL : https://hal.archives-ouvertes.fr/hal-00909353

F. Bonchi and F. Zanasi, Bialgebraic Semantics for Logic Programming, Logical Methods in Computer Science, vol.11, issue.1, p.6095, 2015.
DOI : 10.2168/LMCS-11(1:14)2015
URL : https://hal.archives-ouvertes.fr/hal-01284910

M. Comini, G. Levi, and M. C. Meo, A Theory of Observables for Logic Programs, Information and Computation, vol.169, issue.1, p.2380, 2001.
DOI : 10.1006/inco.2000.3024

P. Fu and E. Komendantskaya, A Type-Theoretic Approach to Resolution, LOPSTR'15, 2015.
DOI : 10.1007/978-3-319-27436-2_6
URL : http://arxiv.org/abs/1510.04661

P. Fu, E. Komendantskaya, T. Schrijvers, and A. Pond, Proof Relevant Corecursive Resolution, FLOPS'16, 2015.
DOI : 10.1007/978-3-319-29604-3_9
URL : http://arxiv.org/abs/1511.09394

S. P. Jones, M. Jones, and E. Meijer, Type classes: An exploration of the design space, 1997.

G. Gupta and V. Costa, Optimal implementation of and-or parallel Prolog, PARLE92, p.7192, 1994.
DOI : 10.1016/0167-739X(94)90052-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4247

H. Jifeng and C. A. Hoare, Categorical semantics for programming languages, Proc MFPS Lecture Notes in Computer Science, vol.442, pp.402-417, 1989.
DOI : 10.1007/BFb0040271

H. Jifeng and C. A. Hoare, Data refinement in a categorical setting, 1990.

P. Johann, E. Komendantskaya, and V. Komendantskiy, Structural Resolution for Logic Programming, Technical Communications of ICLP'15, 2015.

G. M. Kelly, Coherence theorems for lax algebras and for distributive laws, Category seminar, pp.281-375, 1974.
DOI : 10.1007/BFb0059558

G. M. Kelly, Basic concepts of enriched category theory, Soc. Lecture Notes Series, vol.64, 1982.

Y. Kinoshita and A. J. Power, Lax naturality through enrichment, Journal of Pure and Applied Algebra, vol.112, issue.1, pp.53-72, 1996.
DOI : 10.1016/0022-4049(95)00136-0
URL : http://doi.org/10.1016/0022-4049(95)00136-0

Y. Kinoshita and J. Power, A fibrational semantics for logic programs, Proc. Int. Workshop on Extensions of Logic Programming, p.of LNAI, 1996.
DOI : 10.1007/3-540-60983-0_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.9917

E. Komendantskaya, G. Mccusker, and J. Power, Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming, AMAST2010, pp.111-127, 2011.
DOI : 10.1007/BF01762108

E. Komendantskaya and J. Power, Coalgebraic Semantics for Derivations in Logic Programming, CALCO 2011, pp.268-282, 2011.
DOI : 10.1007/978-3-642-22944-2_19

E. Komendantskaya and J. Power, Coalgebraic derivations in logic programming, CSL, LIPIcs, pp.352-366, 2011.
DOI : 10.1007/978-3-642-22944-2_19

E. Komendantskaya, J. Power, and M. Schmidt, Coalgebraic Logic Programming:from Semantics to Implementation, J. Logic Computation, 2014.
DOI : 10.1093/logcom/exu026
URL : http://arxiv.org/abs/1312.6568

E. Komendantskaya, M. Schmidt, and J. Heras, Exploiting Parallelism in Coalgebraic Logic Programming, Electronic Notes in Theoretical Computer Science, vol.303, pp.121-148, 2014.
DOI : 10.1016/j.entcs.2014.02.007
URL : http://doi.org/10.1016/j.entcs.2014.02.007

J. Lloyd, Foundations of Logic Programming, 1987.

S. and M. Lane, Categories for the Working Mathematician, Graduate Texts in Mathematics, vol.5, 1971.
DOI : 10.1007/978-1-4612-9839-7

A. J. Power, An algebraic formulation for data refinement, Proc MFPS Lecture Notes in Computer Science, vol.442, pp.390-401, 1989.
DOI : 10.1007/BFb0040270

G. D. Plotkin and A. J. Power, Adequacy for Algebraic Effects, FOS- SACS 2001, pp.1-24, 2001.
DOI : 10.1007/3-540-45315-6_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.1841

G. D. Plotkin and A. J. Power, Notions of Computation Determine Monads, Proc FOSSACS 2002, pp.342-356, 2002.
DOI : 10.1007/3-540-45931-6_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.2642

L. Simon, A. Bansal, A. Mallya, and G. Gupta, Co-Logic Programming: Extending Logic Programming with Coinduction, Automata, Languages and Programming, pp.472-483, 2007.
DOI : 10.1007/978-3-540-73420-8_42
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.9618

L. Sterling and E. Shapiro, The Art of Prolog, IEEE Expert, vol.2, issue.2, 1986.
DOI : 10.1109/MEX.1987.4307074

R. Street, The formal theory of monads, Journal of Pure and Applied Algebra, vol.2, issue.2, pp.149-168, 1972.
DOI : 10.1016/0022-4049(72)90019-9

J. Worrell, Terminal sequences for accessible endofunctors, Proc CMCS 1999, p.2438, 1999.
DOI : 10.1016/S1571-0661(05)80267-1
URL : http://doi.org/10.1016/s1571-0661(05)80267-1