First-Class Type Classes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Lecture Notes in Computer Science Year : 2008

First-Class Type Classes

Oury Nicolas
  • Function : Author
  • PersonId : 911473

Abstract

Type Classes have met a large success in Haskell and Isabelle, as a solution for sharing notations by overloading and for specifying with abstract structures by quantification on contexts. However, both systems are limited by second-class implementations of these con- structs, and these limitations are only overcomed by ad-hoc extensions to the respective systems. We propose an embedding of type classes into a dependent type theory that is first-class and supports some of the most popular extensions right away. The implementation is correspondingly cheap, general and integrates well inside the system, as we have experimented in Coq. We show how it can be used to help structured programming and proving by way of examples.

Dates and versions

inria-00628864 , version 1 (04-10-2011)

Identifiers

Cite

Matthieu Sozeau, Oury Nicolas. First-Class Type Classes. Lecture Notes in Computer Science, 2008, ⟨10.1007/978-3-540-71067-7_23⟩. ⟨inria-00628864⟩
116 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More