Improving precision of type analysis using non-discriminative union

DOI10.1017/S1471068407003055zbMath1128.68016MaRDI QIDQ5437649

Lunjin Lu

Publication date: 21 January 2008

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

tabling; abstract interpretation; type analysis; non-discriminative union

Mathematics Subject Classification ID

68N17: Logic programming

Related Items

Checking Emptiness of Non-Deterministic Regular Types with Set Operators, A polymorphic type dependency analysis for logic programs

Cites Work

• Unnamed Item
• A polymorphic type system for Prolog
• Properties of substitutions and unifications
• A bottom-up polymorphic type inference in logic programming
• Path dependent analysis of logic programs
• Type dependencies for logic programs using ACI-unification
• Abstract interpretation and application to logic programs
• Deriving descriptions of possible values of program variables by means of abstract interpretation
• Efficient run-time type checking of typed logic programs
• Abstract interpretation based on oldt resolution
• Polymorphic type analysis in logic programs by abstract interpretation
• Type analysis of prolog using type graphs
• The execution algorithm of mercury, an efficient purely declarative logic programming language
• Typing constraint logic programs
• Generalizing Def and Pos to Type Analysis
• A practical framework for theabstract interpretation of logic programs
• A type system for logic programs