Quantified Class Constraints

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationICFP Workshops 2017 - 10th ACM SIGPLAN International Haskell Symposium (Haskell 2017).
PublisherACM
Pages148-161
Number of pages14
ISBN (Print) 978-1-4503-5182-9
DOIs
Publication statusPublished - 7 Sep 2017
Event10th ACM SIGPLAN International Haskell Symposium - Oxford, United Kingdom
Duration: 3 Sep 20179 Sep 2017
https://icfp17.sigplan.org/

Publication series

NameACM SIGPLAN Notices
PublisherACM
Number10
Volume52
ISSN (Print)0362-1340
ISSN (Electronic)1558-1160

Conference

Conference10th ACM SIGPLAN International Haskell Symposium
Abbreviated titleICFP 2017
Country/TerritoryUnited Kingdom
CityOxford
Period3/09/179/09/17
Internet address

Fingerprint

Dive into the research topics of 'Quantified Class Constraints'. Together they form a unique fingerprint.

Cite this