To the gates of HAL: a HAL tutorial

Maria Jose Garcia De La Banda; Bart Demoen; Kim Marriott; Peter J Stuckey

doi:10.1007/3-540-45788-7_3

To the gates of HAL: a HAL tutorial

Maria Jose Garcia De La Banda, Bart Demoen, Kim Marriott, Peter J Stuckey

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

13 Citations (Scopus)

Abstract

Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides semi-optional type, mode and determinism declarations. These allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code. Importantly, it provides type classes which can be used to specify solver interfaces, allowing the constraint programmer to support modelling of a constraint problem independent of a particular solver, leading to easy “plug and play” experimentation with different solvers. Other interesting features include mutable global variables for implementing a constraint store, and dynamic scheduling and Constraint Handling Rules (CHRs) for combining, extending and writing new constraint solvers.

Original language	English
Title of host publication	Functional and Logic Programming
Subtitle of host publication	6th International Symposium, FLOPS 2002 Aizu, Japan, September 15-17, 2002 Proceedings
Editors	Zhenjiang Hu, Mario Rodriguez-Artalejo
Place of Publication	Berlin Germany
Publisher	Springer
Pages	47-66
Number of pages	20
ISBN (Print)	3540442332
DOIs	https://doi.org/10.1007/3-540-45788-7_3
Publication status	Published - 2002
Event	International Symposium on Functional and Logic Programming 2002 - Aizu, Japan Duration: 15 Sept 2002 → 17 Sept 2002 Conference number: 6th https://link.springer.com/book/10.1007/3-540-45788-7 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	2441
ISSN (Print)	0302-9743

Conference

Conference	International Symposium on Functional and Logic Programming 2002
Abbreviated title	FLOPS 2002
Country/Territory	Japan
City	Aizu
Period	15/09/02 → 17/09/02
Internet address	https://link.springer.com/book/10.1007/3-540-45788-7 (Proceedings)

Access to Document

10.1007/3-540-45788-7_3

Cite this

Garcia De La Banda, M. J., Demoen, B., Marriott, K., & Stuckey, P. J. (2002). To the gates of HAL: a HAL tutorial. In Z. Hu, & M. Rodriguez-Artalejo (Eds.), Functional and Logic Programming: 6th International Symposium, FLOPS 2002 Aizu, Japan, September 15-17, 2002 Proceedings (pp. 47-66). (Lecture Notes in Computer Science; Vol. 2441). Springer. https://doi.org/10.1007/3-540-45788-7_3

@inproceedings{fe406bea6c7c4246bc304f8b72363fd4,

title = "To the gates of HAL: a HAL tutorial",

abstract = "Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides semi-optional type, mode and determinism declarations. These allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code. Importantly, it provides type classes which can be used to specify solver interfaces, allowing the constraint programmer to support modelling of a constraint problem independent of a particular solver, leading to easy “plug and play” experimentation with different solvers. Other interesting features include mutable global variables for implementing a constraint store, and dynamic scheduling and Constraint Handling Rules (CHRs) for combining, extending and writing new constraint solvers.",

author = "{Garcia De La Banda}, {Maria Jose} and Bart Demoen and Kim Marriott and Stuckey, {Peter J}",

year = "2002",

doi = "10.1007/3-540-45788-7_3",

language = "English",

isbn = "3540442332",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "47--66",

editor = "Zhenjiang Hu and Mario Rodriguez-Artalejo",

booktitle = "Functional and Logic Programming",

note = "International Symposium on Functional and Logic Programming 2002, FLOPS 2002 ; Conference date: 15-09-2002 Through 17-09-2002",

url = "https://link.springer.com/book/10.1007/3-540-45788-7",

}

Garcia De La Banda, MJ, Demoen, B, Marriott, K & Stuckey, PJ 2002, To the gates of HAL: a HAL tutorial. in Z Hu & M Rodriguez-Artalejo (eds), Functional and Logic Programming: 6th International Symposium, FLOPS 2002 Aizu, Japan, September 15-17, 2002 Proceedings. Lecture Notes in Computer Science, vol. 2441, Springer, Berlin Germany, pp. 47-66, International Symposium on Functional and Logic Programming 2002, Aizu, Japan, 15/09/02. https://doi.org/10.1007/3-540-45788-7_3

To the gates of HAL: a HAL tutorial. / Garcia De La Banda, Maria Jose; Demoen, Bart; Marriott, Kim et al.
Functional and Logic Programming: 6th International Symposium, FLOPS 2002 Aizu, Japan, September 15-17, 2002 Proceedings. ed. / Zhenjiang Hu; Mario Rodriguez-Artalejo. Berlin Germany: Springer, 2002. p. 47-66 (Lecture Notes in Computer Science; Vol. 2441).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - To the gates of HAL

T2 - International Symposium on Functional and Logic Programming 2002

AU - Garcia De La Banda, Maria Jose

AU - Demoen, Bart

AU - Marriott, Kim

AU - Stuckey, Peter J

N1 - Conference code: 6th

PY - 2002

Y1 - 2002

N2 - Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides semi-optional type, mode and determinism declarations. These allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code. Importantly, it provides type classes which can be used to specify solver interfaces, allowing the constraint programmer to support modelling of a constraint problem independent of a particular solver, leading to easy “plug and play” experimentation with different solvers. Other interesting features include mutable global variables for implementing a constraint store, and dynamic scheduling and Constraint Handling Rules (CHRs) for combining, extending and writing new constraint solvers.

AB - Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides semi-optional type, mode and determinism declarations. These allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code. Importantly, it provides type classes which can be used to specify solver interfaces, allowing the constraint programmer to support modelling of a constraint problem independent of a particular solver, leading to easy “plug and play” experimentation with different solvers. Other interesting features include mutable global variables for implementing a constraint store, and dynamic scheduling and Constraint Handling Rules (CHRs) for combining, extending and writing new constraint solvers.

U2 - 10.1007/3-540-45788-7_3

DO - 10.1007/3-540-45788-7_3

M3 - Conference Paper

SN - 3540442332

T3 - Lecture Notes in Computer Science

SP - 47

EP - 66

BT - Functional and Logic Programming

A2 - Hu, Zhenjiang

A2 - Rodriguez-Artalejo, Mario

PB - Springer

CY - Berlin Germany

Y2 - 15 September 2002 through 17 September 2002

ER -