Type dependencies for logic programs using ACI-unification

DOI10.1016/S0304-3975(98)00122-4zbMath0944.68014OpenAlexW2012397892WikidataQ126311264 ScholiaQ126311264MaRDI QIDQ1575243

V. Lagoon, Michael Codish

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00122-4

zbMATH Keywords

logic programstype analysisACI unification

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (4)

Checking Emptiness of Non-Deterministic Regular Types with Set Operators ⋮ A polymorphic type dependency analysis for logic programs ⋮ Improving precision of type analysis using non-discriminative union ⋮ Type dependencies for logic programs using ACI-unification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of unification problems with associative-commutative operators
• Declarative modeling of the operational behavior of logic languages
• A bottom-up polymorphic type inference in logic programming
• Adventures in associative-commutative unification
• Bottom-up abstract interpretation of logic programs
• Type dependencies for logic programs using ACI-unification
• A model-theoretic reconstruction of the operational semantics of logic programs
• Semantics-based program analysis for logic-based languages using XSB
• A lattice-theoretical fixpoint theorem and its applications
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• A Unification Algorithm for Associative-Commutative Functions
• Static analysis of logic programs for independent and parallelism
• The s-semantics approach: Theory and applications
• An algebraic approach to sharing analysis of logic programs

This page was built for publication: Type dependencies for logic programs using ACI-unification