ML Modules and Haskell Type Classes: A Constructive Comparison

Authors:
Stefan Wehr;Manuel M. Chakravarty
Affiliations:
Institut für Informatik, Universität Freiburg, Freiburg i. Br., Germany 79110;School of Computer Science and Engineering, The University of New South Wales, UNSW SYDNEY NSW, Australia 2052
Venue:
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Year:
2008

Citing 20
Cited 2

Abstract types have existential type

ACM Transactions on Programming Languages and Systems (TOPLAS)
How to make ad-hoc polymorphism less ad hoc

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with polymorphic recursion

ACM Transactions on Programming Languages and Systems (TOPLAS)
Applicative functors and fully transparent higher-order modules

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Qualified types: theory and practice

Qualified types: theory and practice
Type classes in Haskell

ACM Transactions on Programming Languages and Systems (TOPLAS)
Using parameterized signatures to express modular structure

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
What is a recursive module?

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
A type-theoretic interpretation of standard ML

Proof, language, and interaction
Recursive structures for standard ML

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML

The Definition of Standard ML
A type system for higher-order modules

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric Overloading in Polymorphic Programming Languages

ESOP '88 Proceedings of the 2nd European Symposium on Programming
Type Classes with Functional Dependencies

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
First-Class Structures for Standard ML

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
A static semantics for Haskell

Journal of Functional Programming
Associated types with class

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Associated type synonyms

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Modular type classes

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Practical type inference for arbitrary-rank types

Journal of Functional Programming

Ad-hoc polymorphism and dynamic typing in a statically typed functional language

Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Code generation via higher-order rewrite systems

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Researchers repeatedly observed that the module system of ML and the type class mechanism of Haskell are related. So far, this relationship has received little formal investigation. The work at hand fills this gap: It introduces type-preserving translations from modules to type classes and vice versa, which enable a thorough comparison of the two concepts.