K. Y. Ahn & A. Vezzosi (2016):
Executable Relational Specifications of Polymorphic Type Systems using Prolog.
In: FLOPS 2016,
pp. 109–125,
doi:10.1007/978-3-319-29604-3_8.
D. Ancona & A. Corradi (2014):
Sound and complete subtyping between coinductive types for object-oriented languages.
In: ECOOP 2014,
pp. 282–307,
doi:10.1007/978-3-662-44202-9_12.
D. Ancona & A. Corradi (2016):
A formal account of SSA in Java-like languages.
In: FTfJP@ECOOP 2016,
pp. 2,
doi:10.1145/2955811.2955813.
D. Ancona & A. Corradi (2016):
Semantic subtyping for imperative object-oriented languages.
In: OOPSLA 2016,
pp. 568–587,
doi:10.1145/2983990.2983992.
D. Ancona & G. Lagorio (2009):
Coinductive Type Systems for Object-Oriented Languages.
In: ECOOP 2009,
pp. 2–26,
doi:10.1007/978-3-642-03013-0_2.
D. Ancona & G. Lagorio (2011):
Idealized coinductive type systems for imperative object-oriented programs.
RAIRO - Theoretical Informatics and Applications 45(1),
pp. 3–33,
doi:10.1051/ita/2011009.
D. Ancona & G. Lagorio (2012):
Static single information form for abstract compilation.
In: IFIP TCS 2012,
pp. 10–27,
doi:10.1007/978-3-642-33475-7_2.
D. Ancona (2010):
Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification?.
In: FoVeOOS 2010, Revised Selected Papers,
pp. 31–45,
doi:10.1007/978-3-642-18070-5_3.
B. Courcelle (1983):
Fundamental Properties of Infinite Trees.
Theor. Comput. Sci. 25,
pp. 95–169,
doi:10.1016/0304-3975(83)90059-2.
E.Komendantskaya, M.Scmidt & Y.Li (2017):
Implementation of Structural Resolution and Coalgebraic Logic Programming.
Available at https://github.com/coalp.
E.Komendantskaya (2017):
A productivity checker for logic programming.
Post-proc. LOPSTR'16.
Available at http://arxiv.org/abs/1608.04415.
M. H. van Emden & M. A. N. Abdallah (1985):
Top-Down Semantics of Fair Computations of Logic Programs.
J. Log. Program. 2(1),
pp. 67–75,
doi:10.1016/0743-1066(85)90005-6.
P. Fu & E. Komendantskaya (2016):
Operational semantics of resolution and productivity in Horn clause logic.
Formal Aspects of Computing,
pp. 1–22,
doi:10.1007/s00165-016-0403-1.
P. Fu, E. Komendantskaya, T. Schrijvers & A. Pond (2016):
Proof Relevant Corecursive Resolution.
In: FLOPS'16,
LNCS 9613.
Springer,
pp. 126–143,
doi:10.1007/978-3-319-29604-3_9.
G. Gupta (2007):
Coinductive Logic Programming and Its Applications.
In: ICLP 2007,
pp. 27–44,
doi:10.1007/978-3-540-74610-2_4.
P. Johann (2015):
Structural Resolution for Logic Programming.
In: Tech. Comm. of ICLP 2015..
Available at http://arxiv.org/abs/1507.06010.
E. Komendantskaya & P. Johann (2015):
Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic.
CoRR abs/1511.07865.
Available at http://arxiv.org/abs/1511.07865.
E. Komendantskaya & Y. Li (2017):
Productive Corecursion in Logic Programming.
In: Under Review.
E. Komendantskaya (2016):
Coalgebraic logic programming: from Semantics to Implementation.
J. Logic and Computation 26(2),
pp. 745,
doi:10.1093/logcom/exu026.
Y. Li (2017):
Structural Resolution with Coinductive Loop Detection.
In: E. Komendantskaya & J. Power: Post-proceedings of CoALP-Ty'16.
Open Publishing Association.
Available at http://arxiv.org/abs/1703.08336.
J. W. Lloyd (1987):
Foundations of Logic Programming, 2nd Edition.
Springer,
doi:10.1007/978-3-642-83189-8.
L. Simon (2006):
Coinductive Logic Programming.
In: ICLP 2006,
pp. 330–345,
doi:10.1007/11799573_25.
M. Sulzmann & P. J. Stuckey (2008):
HM(X) type inference is CLP(X) solving.
J. Funct. Program. 18(2),
pp. 251–283,
doi:10.1017/S0956796807006569.
eptcs@eptcs.org