Quantified Class Constraints

Gert-Jan  Bottu; Georgios  Karachalias; Tom Schrijvers; Bruno C. d. S.  Oliveira; Philip Wadler

doi:10.1145/3122955.3122967

Quantified Class Constraints

Gert-Jan Bottu, Georgios Karachalias, Tom Schrijvers, Bruno C. d. S. Oliveira, Philip Wadler

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

Quantified class constraints have been proposed many years ago to raise the expressive power of type classes from Horn clauses to the universal fragment of Hereditiary Harrop logic. Yet, while it has been much asked for over the years, the feature was never implemented or studied in depth. Instead, several workarounds have been proposed, all of which are ultimately stopgap measures.
This paper revisits the idea of quantified class constraints and elaborates it into a practical language design. We show the merit of quantified class constraints in terms of more expressive modeling and in terms of terminating type class resolution. In addition, we provide a declarative specification of the type system as well as a type inference algorithm that elaborates into System F. Moreover,
we discuss termination conditions of our system and also provide a prototype implementation.

Original language	English
Title of host publication	ICFP Workshops 2017 - 10th ACM SIGPLAN International Haskell Symposium (Haskell 2017).
Publisher	ACM
Pages	148-161
Number of pages	14
ISBN (Print)	978-1-4503-5182-9
DOIs	https://doi.org/10.1145/3122955.3122967
Publication status	Published - 7 Sept 2017
Event	10th ACM SIGPLAN International Haskell Symposium - Oxford, United Kingdom Duration: 3 Sept 2017 → 9 Sept 2017 https://icfp17.sigplan.org/

Publication series

Name	ACM SIGPLAN Notices
Publisher	ACM
Number	10
Volume	52
ISSN (Print)	0362-1340
ISSN (Electronic)	1558-1160

Conference

Conference	10th ACM SIGPLAN International Haskell Symposium
Abbreviated title	ICFP 2017
Country/Territory	United Kingdom
City	Oxford
Period	3/09/17 → 9/09/17
Internet address	https://icfp17.sigplan.org/

Access to Document

10.1145/3122955.3122967

quantccAccepted author manuscript, 803 KB

https://dl.acm.org/citation.cfm?doid=3122955.3122967

Cite this

@inproceedings{25e8320f6e4742c1a8e3d4626e8a4c60,

title = "Quantified Class Constraints",

abstract = "Quantified class constraints have been proposed many years ago to raise the expressive power of type classes from Horn clauses to the universal fragment of Hereditiary Harrop logic. Yet, while it has been much asked for over the years, the feature was never implemented or studied in depth. Instead, several workarounds have been proposed, all of which are ultimately stopgap measures.This paper revisits the idea of quantified class constraints and elaborates it into a practical language design. We show the merit of quantified class constraints in terms of more expressive modeling and in terms of terminating type class resolution. In addition, we provide a declarative specification of the type system as well as a type inference algorithm that elaborates into System F. Moreover,we discuss termination conditions of our system and also provide a prototype implementation. ",

author = "Gert-Jan Bottu and Georgios Karachalias and Tom Schrijvers and Oliveira, {Bruno C. d. S.} and Philip Wadler",

year = "2017",

month = sep,

day = "7",

doi = "10.1145/3122955.3122967",

language = "English",

isbn = " 978-1-4503-5182-9",

series = "ACM SIGPLAN Notices",

publisher = "ACM",

number = "10",

pages = "148--161",

booktitle = "ICFP Workshops 2017 - 10th ACM SIGPLAN International Haskell Symposium (Haskell 2017).",

note = "10th ACM SIGPLAN International Haskell Symposium, ICFP 2017 ; Conference date: 03-09-2017 Through 09-09-2017",

url = "https://icfp17.sigplan.org/",

}

Bottu, G-J, Karachalias, G, Schrijvers, T, Oliveira, BCDS & Wadler, P 2017, Quantified Class Constraints. in ICFP Workshops 2017 - 10th ACM SIGPLAN International Haskell Symposium (Haskell 2017).. ACM SIGPLAN Notices, no. 10, vol. 52, ACM, pp. 148-161, 10th ACM SIGPLAN International Haskell Symposium, Oxford, United Kingdom, 3/09/17. https://doi.org/10.1145/3122955.3122967

TY - GEN

T1 - Quantified Class Constraints

AU - Bottu, Gert-Jan

AU - Karachalias, Georgios

AU - Schrijvers, Tom

AU - Oliveira, Bruno C. d. S.

AU - Wadler, Philip

PY - 2017/9/7

Y1 - 2017/9/7

N2 - Quantified class constraints have been proposed many years ago to raise the expressive power of type classes from Horn clauses to the universal fragment of Hereditiary Harrop logic. Yet, while it has been much asked for over the years, the feature was never implemented or studied in depth. Instead, several workarounds have been proposed, all of which are ultimately stopgap measures.This paper revisits the idea of quantified class constraints and elaborates it into a practical language design. We show the merit of quantified class constraints in terms of more expressive modeling and in terms of terminating type class resolution. In addition, we provide a declarative specification of the type system as well as a type inference algorithm that elaborates into System F. Moreover,we discuss termination conditions of our system and also provide a prototype implementation.

AB - Quantified class constraints have been proposed many years ago to raise the expressive power of type classes from Horn clauses to the universal fragment of Hereditiary Harrop logic. Yet, while it has been much asked for over the years, the feature was never implemented or studied in depth. Instead, several workarounds have been proposed, all of which are ultimately stopgap measures.This paper revisits the idea of quantified class constraints and elaborates it into a practical language design. We show the merit of quantified class constraints in terms of more expressive modeling and in terms of terminating type class resolution. In addition, we provide a declarative specification of the type system as well as a type inference algorithm that elaborates into System F. Moreover,we discuss termination conditions of our system and also provide a prototype implementation.

U2 - 10.1145/3122955.3122967

DO - 10.1145/3122955.3122967

M3 - Conference contribution

SN - 978-1-4503-5182-9

T3 - ACM SIGPLAN Notices

SP - 148

EP - 161

BT - ICFP Workshops 2017 - 10th ACM SIGPLAN International Haskell Symposium (Haskell 2017).

PB - ACM

T2 - 10th ACM SIGPLAN International Haskell Symposium

Y2 - 3 September 2017 through 9 September 2017

ER -

Quantified Class Constraints

Abstract / Description of output

Publication series

Conference

Access to Document

Fingerprint

Cite this