Transforming Boolean equalities into constraints

DOI10.1007/S00165-016-0399-6MaRDI QIDQ2628300zbMATH OpenOpenAlexFDO

Authors Sergio Antoy, Michael Hanus

Publication date 1 June 2017

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-016-0399-6

zbMATH Keywords

functional logic programmingprogram analysisprogram transformationunification

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18)

Recommendations

• From Boolean equalities to constraints
• Logic programming with equations
• A proposal for disequality constraints in Curry
• scientific article; zbMATH DE number 4043302
• Transforming equality logic to propositional logic

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• A needed narrowing strategy
• Abstract diagnosis of functional programs
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Functional Logic Programming: From Theory to Curry
• scientific article; zbMATH DE number 3679159 (Why is no real title available?)
• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• Operational semantics for declarative multi-paradigm languages
• Programming with narrowing: a tutorial
• The execution algorithm of mercury, an efficient purely declarative logic programming language

Cited in

(2)

• scientific article; zbMATH DE number 5139161 (Why is no real title available?)
• From Boolean equalities to constraints

Describes a project that uses

Uses Software

• Haskell
• KiCS2
• Curry
• PAKCS
• Mercury

This page was built for publication: Transforming Boolean equalities into constraints

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