Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Polymorphic type inference in Prolog by abstract interpretation
Proceedings of the 6th Conference on Logic programming '87
A finite presentation theorem for approximating logic programs
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
A bottom-up polymorphic type inference in logic programming
Science of Computer Programming
Abstract interpretation based on OLDT resolution
Journal of Logic Programming
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
Fast and precise regular approximations of logic programs
Proceedings of the eleventh international conference on Logic programming
Weakest preconditions for pure Prolog programs
Information Processing Letters
Type dependencies for logic programs using ACI-unification
Theoretical Computer Science
A precise type analysis of logic programs
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming
Type inference in prolog and its application
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Path Dependent Analysis of Logic Programs
Higher-Order and Symbolic Computation
Automatic type inference via partial evaluation
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Inverting abstract unification for set-sharing
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
| Hi-index | 0.00 |
This paper presents a backward type analysis for logic programs. Given type signatures for a collection of selected predicates such as builtin or library predicates, the analysis infers type signatures for other predicates such that the execution of any query satisfying the inferred type signatures will not violate the type signatures for the selected predicates. Thus, the backward type analysis generalises type checking in which the programmer manually specifies type signatures for all predicates that are checked for consistency by a type checker.