ML Modules and Haskell Type Classes: A Constructive Comparison

Wehr, Stefan; Chakravarty, Manuel M. T.

doi:10.1007/978-3-540-89330-1_14

Cited by 8 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Haskell's deriving is tied to type classes, which have no direct parallel in OCaml. However, there is a well-known correspondence [6,21,30] between ML's modules and Haskell's type classes, which we use to guide our design. The relevant facets of the correspondence are illustrated in Figure 3:…”

Section: Modules and Type Classesmentioning

confidence: 99%

Practical generic programming in OCaml

Yallop

2007

Proceedings of the 2007 Workshop on Workshop on ML

View full text Add to dashboard Cite

We describe deriving, a system of extensible generic functions for OCaml implemented as a preprocessor and supporting library. We argue that generating code from type-definitions has significant advantages over a combinator approach, taking serialisation as an example application: our generate-your-boilerplate design results in a system that is easy to use, has comprehensive coverage of types and handles cyclic values without imposing a burden on the user. Users can extend generic functions with specialised implementations at particular types; we show how this can lead to dramatically improved performance in the serialisation task without the user writing a single line of serialisation code.

show abstract

Section: Modules and Type Classesmentioning

confidence: 99%

Practical generic programming in OCaml

Yallop

2007

Proceedings of the 2007 Workshop on Workshop on ML

View full text Add to dashboard Cite

show abstract

“…Wehr et al [21] give a comparison and translation between modules and type classes. This translation does not consider the implicit aspect of type classes, but does illustrate the relationship between type class features (e.g.…”

Section: Modular Type Classesmentioning

confidence: 99%

Modular implicits

White¹,

Bour²,

Yallop³

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We present modular implicits, an extension to the OCaml language for ad-hoc polymorphism inspired by Scala implicits and modular type classes. Modular implicits are based on type-directed implicit module parameters, and elaborate straightforwardly into OCaml's first-class functors. Basing the design on OCaml's modules leads to a system that naturally supports many features from other languages with systematic ad-hoc overloading, including inheritance, instance constraints, constructor classes and associated types.

show abstract

“…An interesting alternative to the classic dictionary translation formalized above is Wehr's representation of dictionaries as ML modules [21]. This avoids polymorphic recursion which may otherwise arise in the translation (although this is rare in practice).…”

Section: Dictionary Translationmentioning

confidence: 99%

“…Well-typedness is frequently dealt with in the type class literature (e.g. [20]) and we concentrate on semantic arguments.…”

Section: Correctnessmentioning

confidence: 99%

Code Generation via Higher-Order Rewrite Systems

Haftmann

Nipkow

2010

Functional and Logic Programming

144

131

View full text Add to dashboard Cite

Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many possible targets (functional programming languages), we introduce an intermediate language, MiniHaskell. To relate the source and the intermediate language, both are given a semantics in terms of higher-order rewrite systems (HRSs). In a second step, type classes are removed from Mini-Haskell programs by means of a dictionary translation; we prove the correctness of this step. Building on equational logic also directly supports a simple but powerful algorithm and data refinement concept.

show abstract

ML Modules and Haskell Type Classes: A Constructive Comparison

Cited by 8 publications

References 22 publications

Practical generic programming in OCaml

Practical generic programming in OCaml

Modular implicits

Code Generation via Higher-Order Rewrite Systems

Contact Info

Product

Resources

About