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.
|Number of pages||17|
|Journal||Electronic Proceedings in Theoretical Computer Science|
|Publication status||Published - 13 Sept 2017|
|Event||1st Workshop on Coalgebra, Horn Clause Logic Programming and Types - Edinburgh, United Kingdom|
Duration: 28 Nov 2016 → 29 Nov 2016
ASJC Scopus subject areas