Constraint Handling Rules with Binders, Patterns and Generic Quantification

Alejandro Serrano; J. Hage

doi:10.1017/S1471068417000230

Constraint Handling Rules with Binders, Patterns and Generic Quantification

Alejandro Serrano, J. Hage

Research output: Contribution to journal › Article › Academic › peer-review

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.

Original language	English
Pages (from-to)	992-1009
Number of pages	18
Journal	Theory and Practice of Logic Programming
Volume	17
Issue number	5-6
DOIs	https://doi.org/10.1017/S1471068417000230
Publication status	Published - 2017
Event	33rd International Conference on Logic Programming - Melbourne, Australia Duration: 28 Aug 2017 → 1 Sept 2017 http://iclp17.a4lp.org/

Keywords

Constraint Handling Rules
pattern unification
generic quantification

Access to Document

10.1017/S1471068417000230

constraint_handling_rules_with_binders_patterns_and_generic_quantificationFinal published version, 315 KBLicence: Taverne

Cite this

@article{c222371249e7426793728b2c144e4228,

title = "Constraint Handling Rules with Binders, Patterns and Generic Quantification",

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 = "Constraint Handling Rules, pattern unification, generic quantification",

author = "Alejandro Serrano and J. Hage",

year = "2017",

doi = "10.1017/S1471068417000230",

language = "English",

volume = "17",

pages = "992--1009",

journal = "Theory and Practice of Logic Programming",

issn = "1471-0684",

publisher = "Cambridge University Press",

number = "5-6",

note = "33rd International Conference on Logic Programming, ICLP 2017 ; Conference date: 28-08-2017 Through 01-09-2017",

url = "http://iclp17.a4lp.org/",

}

TY - JOUR

T1 - Constraint Handling Rules with Binders, Patterns and Generic Quantification

AU - Serrano, Alejandro

AU - Hage, J.

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

KW - Constraint Handling Rules

KW - pattern unification

KW - generic quantification

U2 - 10.1017/S1471068417000230

DO - 10.1017/S1471068417000230

M3 - Article

SN - 1471-0684

VL - 17

SP - 992

EP - 1009

JO - Theory and Practice of Logic Programming

JF - Theory and Practice of Logic Programming

IS - 5-6

T2 - 33rd International Conference on Logic Programming

Y2 - 28 August 2017 through 1 September 2017

ER -

Constraint Handling Rules with Binders, Patterns and Generic Quantification

Abstract

Keywords

Access to Document

Fingerprint

Cite this