Constraint handling rules with binders, patterns and generic quantification*. Issue 5 (22nd August 2017)

• Record Type: Journal Article
• Authors: SERRANO, ALEJANDRO; HAGE, JURRIAAN
• Editors: Rocha, Ricardo; Cao Son, Tran
• Is Part Of: Theory and practice of logic programming. Volume 17:Issue 5/6(2017)
• Page Start: 992
• Page End: 1009
• Publication Date: 2017-08-22
• Subjects: Constraint Handling Rules, -- pattern unification, -- generic quantification; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068417000230
• Languages: English
• ISSNs: 1471-0684

Abstract

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.