Coherent Explicit Dictionary Application for Haskell: Formalisation and Coherence Proof

07/30/2018
by   Thomas Winant, et al.
0

Type classes are one of Haskell's most popular features and extend its type system with ad-hoc polymorphism. Since their conception, there were useful features that could not be offered because of the desire to offer two correctness properties: coherence and global uniqueness of instances. Coherence essentially guarantees that program semantics are independent from type-checker internals. Global uniqueness of instances is relied upon by libraries for enforcing, for example, that a single order relation is used for all manipulations of an ordered binary tree. The features that could not be offered include explicit dictionary application and local instances, which would be highly useful in practice. We propose a new design for offering explicit dictionary application, without compromising coherence and global uniqueness. We introduce a novel criterion based on GHC's type argument roles to decide when a dictionary application is safe with respect to global uniqueness of instances. We preserve coherence by detecting potential sources of incoherence, and prove it formally. Moreover, our solution makes it possible to use local dictionaries. In addition to developing our ideas formally, we have implemented a working prototype in GHC. This report contains the full formalisation and coherence proof.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/28/2012

Learning Dictionaries with Bounded Self-Coherence

Sparse coding in learned dictionaries has been established as a successf...
07/01/2019

Coherence of Type Class Resolution

Elaboration-based type class resolution, as found in languages like Hask...
03/11/2021

Improved Coherence Index-Based Bound in Compressive Sensing

Within the Compressive Sensing (CS) paradigm, sparse signals can be reco...
10/25/2017

Logical relations for coherence of effect subtyping

A coercion semantics of a programming language with subtyping is typical...
05/05/2021

Uniqueness typing for intersection types

Working in a variant of the intersection type assignment system of Coppo...
11/30/2020

Learnable Motion Coherence for Correspondence Pruning

Motion coherence is an important clue for distinguishing true correspond...
06/30/2018

Flexible recovery of uniqueness and immutability (Extended Version)

We present an imperative object calculus where types are annotated with ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.