A type system for logic programs
Concurrent Prolog: collected papers
Declaration-free type checking
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow analysis and optimization of LISP-like structures
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Program Flow Analysis: Theory and Application
Program Flow Analysis: Theory and Application
Static type inference in a dynamically typed language
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient dataflow analysis of logic programs
Journal of the ACM (JACM)
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Cost analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type analysis of Prolog using type graphs
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Set-based analysis of ML programs
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Semantic models and abstract interpretation techniques for inductive data structures and pointers
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Type analysis of logic programs in the presence of type definitions
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Formal language, grammar and set-constraint-based program analysis by abstract interpretation
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
On the complexity of set-based analysis
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Paths vs. trees in set-based program analysis
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A precise type analysis of logic programs
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Constraints and constraint solving: an introduction
Constraints in computational logics
Regular Tree Languages as an Abstract Domain in Program Specialisation
Higher-Order and Symbolic Computation
Information and Computation
On the complexity analysis of static analyses
Journal of the ACM (JACM)
Generalized Definite Set Constraints
Constraints
On Dart-Zobel Algorithm for testing regular type inclusion
ACM SIGPLAN Notices
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Directional Type Checking for Logic Programs: Beyond Discriminative Types
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Backward Type Inference Generalises Type Checking
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Atomic Set Constraints with Projection
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
An incremental unique representation for regular trees
Nordic Journal of Computing
Set constraints with intersection
Information and Computation - Special issue: LICS'97
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Using parametric set constraints for locating errors in CLP programs
Theory and Practice of Logic Programming
A practical type analysis for verification of modular prolog programs
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Improving precision of type analysis using non-discriminative union
Theory and Practice of Logic Programming
Type inference for datalog and its application to query optimisation
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Type inference for datalog with complex type hierarchies
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Set constraints with projections
Journal of the ACM (JACM)
On the alternation-free horn µ-calculus
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Inference of well-typings for logic programs with application to termination analysis
SAS'05 Proceedings of the 12th international conference on Static Analysis
Control-flow analysis of functional programs
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
The notion of Cartesian closure on a set of unifiers has been used to define approximations of the least models of logic programs. Such approximations, often called types, are not known to be recursive. In this paper, we use Cartesian closure to define a similar, but more accurate, approximation. The main result proves that our approximation is not only recursive, but that it can be finitely represented in the form of a cyclic term graph. This explicit representation can be used as a starting point for logic program analyzers.