Abstract
No abstract available.
Skip Table Of Content Section
Article
A precise type analysis of logic programs
Pages 214–225https://doi.org/10.1145/351268.351293
This paper presents a new type analysis for logic programs. The type information in a set of substitutions is described by a disjunction of variable typings each of which maps a variable to a non-deterministic regular type. The use of non-deterministic ...
Index Terms
- Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Recommendations
Acceptance Rates
PPDP '00 Paper Acceptance Rate 26 of 65 submissions, 40%;
Overall Acceptance Rate 230 of 486 submissions, 47%