Inferring precise polymorphic type dependencies in logic programs

Authors:
Lunjin Lu
Affiliations:
Oakland University
Venue:
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Year:
2008

Citing 10
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
A type system for logic program

Journal of Logic Programming
Abstract interpretation and application to logic programs

Journal of Logic Programming
A bottom-up polymorphic type inference in logic programming

Science of Computer Programming
Fast and precise regular approximations of logic programs

Proceedings of the eleventh international conference on Logic programming
Type dependencies for logic programs using ACI-unification

Theoretical Computer Science
Program analysis, debugging, and optimization using the ciao system preprocessor

Proceedings of the 1999 international conference on Logic programming
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Improving precision of type analysis using non-discriminative union

Theory and Practice of Logic Programming
Inference of well-typings for logic programs with application to termination analysis

SAS'05 Proceedings of the 12th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new analysis that infers polymorphic type dependencies in logic programs. The analysis infers more precise information than previous type dependency inference analyses. The improvement in precision is achieved by making use of set union as a type constructor and non-deterministic type definitions.