A polymorphic type system for PROLOG.
Artificial Intelligence
An application of abstract interpretation of logic programs: occur check reduction
Proc. of the European symposium on programming on ESOP 86
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Prolog and its performance: exploiting independent and-parallelism
Logic programming
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Static analysis of logic programs for independent and parallelism
Journal of Logic Programming
Live-structure dataflow analysis for Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
Type analysis of Prolog using type graphs
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
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
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Combining Norms to Prove Termination
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Pos(T): Analyzing Dependencies in Typed Logic Programs
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Reuse of Results in Termination Analysis of Typed Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Detecting determinacy in prolog programs
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
| Hi-index | 0.00 |
The paper presents a novel approach to the analysis of typed logic programs. We assume regular type descriptions of logic program variables provided by regular tree grammars. Types are used to identify components of terms which can be equated during the programs execution. This information is reflected in form of set constraints in the generic abstract domain called Type(X). The domain allows for abstract compilation of typed logic programs into set logic programs. We demonstrate how the analyzers of groundness and sharing of typed logic programs are obtained by applying the existing (untyped) techniques based on Pos and Sharing to set logic programs. The corresponding analyses in Type(Pos) and Type(Sharing) are more precise than those in Pos and Sharing.