Structural Resolution for Abstract Compilation of Object-Oriented Languages

Luca Franceschini
(University of Genoa, Italy)
Davide Ancona
(University of Genoa, Italy)
Ekaterina Komendantskaya
(Heriot-Watt University, Edinburgh, UK)

We propose abstract compilation for precise static type analysis of object-oriented languages based on coinductive logic programming. Source code is translated to a logic program, then type-checking and inference problems amount to queries to be solved with respect to the resulting logic program. We exploit a coinductive semantics to deal with infinite terms and proofs produced by recursive types and methods. Thanks to the recent notion of structural resolution for coinductive logic programming, we are able to infer very precise type information, including a class of irrational recursive types causing non-termination for previously considered coinductive semantics. We also show how to transform logic programs to make them satisfy the preconditions for the operational semantics of structural resolution, and we prove this step does not affect the semantics of the logic program.

In Ekaterina Komendantskaya and John Power: Proceedings of the First Workshop on Coalgebra, Horn Clause Logic Programming and Types (CoALP-Ty'16), Edinburgh, UK, 28-29 November 2016, Electronic Proceedings in Theoretical Computer Science 258, pp. 19–35.
Published: 13th September 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.258.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org