Transforming Boolean equalities into constraints

DOI10.1007/s00165-016-0399-6zbMath1362.68034OpenAlexW2531992632MaRDI QIDQ2628300

Michael Hanus, Sergio Antoy

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

unificationprogram transformationprogram analysisfunctional logic programming

Mathematics Subject Classification ID

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

Uses Software

• Haskell
• KiCS2
• Mercury
• Curry
• PAKCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programming with narrowing: a tutorial
• Operational semantics for declarative multi-paradigm languages
• Abstract Diagnosis of Functional Programs
• A needed narrowing strategy
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• The execution algorithm of mercury, an efficient purely declarative logic programming language
• Functional Logic Programming: From Theory to Curry
• A Machine-Oriented Logic Based on the Resolution Principle

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