chrKanren: Constraint Handling Rules in a Relational Language
Electronic Proceedings in Theoretical Computer Science · 20.07.2026 · 450 · 416-429
DOI: 10.4204/eptcs.450.30 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 20.07.2026. Verfasst von Rafaello Sanna und 2 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben.
Abstract (Originalsprache)
We present chrKanren, a dialect of the purely relational constraint logic programming language miniKanren which includes support for Constraint Handling Rules (CHR), a language for writing rule-based programs such as constraint solvers. We show how to integrate CHR's constraint propagation mechanism into the language of miniKanren search streams such that both processes remain complete. We also use chrKanren to illustrate novel applications of constraints in miniKanren, such as semantic unification of user-defined data structures and type-and-example-directed synthesis for relational interpreters in the style of MYTH.
Zitieren
APA
Sanna, R., Byrd, W. E., & Amin, N. (2026). chrKanren: Constraint Handling Rules in a Relational Language. Electronic Proceedings in Theoretical Computer Science, 450, 416-429. https://doi.org/10.4204/eptcs.450.30
Vancouver
Sanna R, Byrd WE, Amin N. chrKanren: Constraint Handling Rules in a Relational Language. Electronic Proceedings in Theoretical Computer Science. 2026;450:416-429. doi:10.4204/eptcs.450.30
BibTeX
@article{Sanna2026,
author = {Sanna, Rafaello and Byrd, William E. and Amin, Nada},
title = {chrKanren: Constraint Handling Rules in a Relational Language},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {450},
pages = {416--429},
doi = {10.4204/eptcs.450.30}
}
EUVIMED