A polymorphic type system for PROLOG.
Artificial Intelligence
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
Polymorphic algebraic data type reconstruction
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Inference of well-typings for logic programs with application to termination analysis
SAS'05 Proceedings of the 12th international conference on Static Analysis
A transformational approach for proving properties of the CHR constraint store
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
Type information has many applications; it can e.g. be used in optimized compilation, termination analysis and error detection. However, logic programs are typically untyped. A well-typed program has the property that it behaves identically on well-typed goals with or without type checking. Hence the automatic inference of a well-typing is worthwhile. Existing inferences are either cheap and inaccurate, or accurate and expensive. By giving up the requirement that all calls to a predicate have types that are instances of a unique polymorphic type but instead allowing multiple polymorphic typings for the same predicate, we obtain a novel strongly-connected-component-based analysis that provides a good compromise between accuracy and computational cost.