Skip to main content
Kent Academic Repository

Haskell Type Constraints Unleashed

Orchard, Dominic A., Schrijvers, Tom (2010) Haskell Type Constraints Unleashed. Lecture Notes in Computer Science, . pp. 56-71. ISSN 0302-9743. (doi:10.1007/978-3-642-12251-4_6) (KAR id:57498)

Abstract

The popular Glasgow Haskell Compiler extends the Haskell 98 type system with several powerful features, leading to an expressive language of type terms. In contrast, constraints over types have received much less attention, creating an imbalance in the expressivity of the type system. In this paper, we rectify the imbalance, transferring familiar type-level constructs, synonyms and families, to the language of constraints, providing a symmetrical set of features at the type-level and constraint-level. We introduce constraint synonyms and constraint families, and illustrate their increased expressivity for improving the utility of polymorphic EDSLs in Haskell, amongst other examples. We provide a discussion of the semantics of the new features relative to existing type system features and similar proposals, including details of termination

Item Type: Article
DOI/Identification number: 10.1007/978-3-642-12251-4_6
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Dominic Orchard
Date Deposited: 05 May 2017 13:33 UTC
Last Modified: 05 Nov 2024 10:47 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/57498 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.