Constraint Handling Rules with Binders, Patterns and Generic Quantification
Logic in Computer Science
2017-07-11 v1
Abstract
Constraint Handling Rules provide descriptions for constraint solvers. However, they fall short when those constraints specify some binding structure, like higher-rank types in a constraint-based type inference algorithm. In this paper, the term syntax of constraints is replaced by -tree syntax, in which binding is explicit; and a new generic quantifier is introduced, which is used to create new fresh constants.
Keywords
Cite
@article{arxiv.1707.02754,
title = {Constraint Handling Rules with Binders, Patterns and Generic Quantification},
author = {Alejandro Serrano and Jurriaan Hage},
journal= {arXiv preprint arXiv:1707.02754},
year = {2017}
}
Comments
Paper presented at the 33nd International Conference on Logic Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1, 2017 16 pages, LaTeX, no PDF figures