As time goes by: constraint handling rules: a survey of CHR research from 1998 to 2007

J Sneyers, P Van Weert, T Schrijvers… - Theory and practice of …, 2010 - cambridge.org
Constraint Handling Rules (CHR) is a high-level programming language based on
multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint …

[КНИГА][B] Modelling and controlling of behaviour for autonomous mobile robots

H Skubch - 2012 - books.google.com
As research progresses, it enables multi-robot systems to be used in more and more
complex and dynamic scenarios. Hence, the question arises how different modelling and …

Constraint handling rules-what else?

T Frühwirth - … Foundations, Tools, and Applications: 9th International …, 2015 - Springer
Abstract Constraint Handling Rules (CHR) is both an effective concurrent declarative
constraint-based programming language and a versatile computational formalism. While …

How type errors were fixed and what students did?

B Wu, S Chen - Proceedings of the ACM on Programming Languages, 2017 - dl.acm.org
Providing better supports for debugging type errors has been an active research area in the
last three decades. Numerous approaches from different perspectives have been …

Representing argumentation schemes with constraint handling rules (chr)

TF Gordon, H Friedrich, D Walton - Argument & Computation, 2018 - journals.sagepub.com
We present a high-level declarative programming language for representing argumentation
schemes, where schemes represented in this language can be easily validated by domain …

Efficient lazy evaluation of rule-based programs

P Van Weert - IEEE Transactions on Knowledge and Data …, 2009 - ieeexplore.ieee.org
Thirty years after Forgy's seminal dissertation, Rete remains the de facto standard matching
algorithm. Despite promising research results, alternative algorithms such as TREAT and …

Linear-logic based analysis of constraint handling rules with disjunction

H Betz, T Frühwirth - ACM Transactions on Computational Logic (TOCL), 2013 - dl.acm.org
Constraint Handling Rules (CHR) is a declarative rule-based programming language that
has cut out its niche over the course of the last 20 years. It generalizes concurrent constraint …

Polymonad programming in Haskell

J Bracker, H Nilsson - Proceedings of the 27th Symposium on the …, 2015 - dl.acm.org
Polymonads were recently introduced by Hicks et al. as a unified approach to programming
with different notions of monads. Their work was mainly focused on foundational aspects of …

[PDF][PDF] Theoretical basis for making equivalent transformation rules from logical equivalences for program synthesis

K Miura, K Akama, H Mabuchi… - International Journal of …, 2013 - kitami-it.repo.nii.ac.jp
To propose methods for making Equivalent Transformation (ET) rules is important for
generating correct and sufficiently efficient programs from a specification which is a set of …

Compiling CHR to parallel hardware

A Triossi, S Orlando, A Raffaeta… - Proceedings of the 14th …, 2012 - dl.acm.org
This paper investigates the compilation of a committed-choice rule-based language,
Constraint Handling Rules (CHR), to specialized hardware circuits. The developed …