Soundness, idempotence and commutativity of set-sharing

DOI10.1017/S1471068401001338MaRDI QIDQ4452614zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Patricia M. Hill, Roberto Bagnara, Enea Zaffanella

Publication date 1 March 2004

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

Full work available at URL http://journals.cambridge.org/action/displayIssue?jid=TLP&volumeId=2&issueId=02

zbMATH Keywords

logic programmingrational treesAbstract interpretationoccurs-checkset-sharing

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Complete sets of reductions modulo associativity, commutativity and identity
• scientific article; zbMATH DE number 6005157
• scientific article; zbMATH DE number 1222415
• Sets of Commuting Derivations and Simplicity
• Commutativity of rings with identities on subsets
• The separability axiom and equal-sharing methods
• Normality theorems on shared sets
• Idempotents in compact semigroups and Ramsey theory
• Set-Menger and related properties
• Idempotent analysis and continuous semilattices

Cited in

(8)

• Functional and Logic Programming
• scientific article; zbMATH DE number 7205326 (Why is no real title available?)
• Parallel Logic Programming: A Sequel
• An algebraic approach to sharing analysis of logic programs
• Set-sharing is redundant for pair-sharing
• Non-strict independence-based program parallelization using sharing and freeness information
• Collapsing Closures
• Finite-tree analysis for constraint logic-based languages

This page was built for publication: Soundness, idempotence and commutativity of set-sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452614)