Paper Info
Title
Type classes in Mercury
Abstract
The type systems of functional languages such as Haskell have recently become more powerful and expressive. They not only allow programmers to write code that works on values of any type (genericity), they also allow programmers to require that a particular type belongs to a given type class (constrained genericity). Such code may use any of the methods of the type class, since every type that is a member of the type class must implement those methods. This capability makes it significantly easier to express solutions to many common problems, and promotes code reuse. Incorporating type classes in a logic programming language provides some new challenges. In this paper, we explain how we have extended Mercury's type system to include support for type classes. We show that type classes integrate very nicely with Mercury's mode, determinism and uniqueness systems, and describe how our implementation works
Year
DOI
Venue
2000
10.1109/ACSC.2000.824391
Canberra, ACT
Keywords
Field
DocType
logic programming languages,type theory,Mercury,code reuse,functional languages,logic programming language,type system,type systems
Uniqueness type,Programming language,Unit type,Composite data type,Computer science,Theoretical computer science,Haskell,Type safety,Recursive data type,Abstract type,Type class
Conference
ISBN
Citations 
PageRank 
0-7695-0518-X
14
1.41
References 
Authors
6
3
Name
Order
Citations
PageRank
David Jeffery1366.49
Fergus Henderson229634.54
Zoltan Somogyi3571141.85