Coherence of Type Class Resolution

by   Gert-Jan Bottu, et al.

Elaboration-based type class resolution, as found in languages like Haskell, Mercury and PureScript, is generally nondeterministic: there can be multiple ways to satisfy a wanted constraint in terms of global instances and locally given constraints. Coherence is the key property that keeps this sane; it guarantees that, despite the nondeterminism, programs still behave predictably. Even though elaboration-based resolution is generally assumed coherent, as far as we know, there is no formal proof of this property in the presence of sources of nondeterminism, like superclasses and flexible contexts. This paper provides a formal proof to remedy the situation. The proof is non-trivial because the semantics elaborates resolution into a target language where different elaborations can be distinguished by contexts that do not have a source language counterpart. Inspired by the notion of full abstraction, we present a two-step strategy that first elaborates nondeterministically into an intermediate language that preserves contextual equivalence, and then deterministically elaborates from there into the target language. We use an approach based on logical relations to establish contextual equivalence and thus coherence for the first step of elaboration, while the second step's determinism straightforwardly preserves this coherence property.



There are no comments yet.


page 1

page 2

page 3

page 4


Logical relations for coherence of effect subtyping

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

Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation

Good programming languages provide helpful abstractions for writing secu...

Coherent Explicit Dictionary Application for Haskell: Formalisation and Coherence Proof

Type classes are one of Haskell's most popular features and extend its t...

Proof nets, coends and the Yoneda isomorphism

Proof nets provide permutation-independent representations of proofs and...

The Combinatorics of Salva Veritate Principles

Various concepts of grammatical compositionality arise in many theories ...

The Benefit of Being Non-Lazy in Probabilistic λ-calculus

We consider the probabilistic applicative bisimilarity (PAB), a coinduct...

Coherent Interaction Graphs

We introduce the notion of coherent graphs, and show how those can be us...
This week in AI

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