Classes of Arbitrary Kind
The type class system in the Haskell Programming language provides a useful abstraction for a wide range of types, such as those that support comparison, serialization, ordering, between others. This system can be extended by the programmer by providing custom instances to one’s custom types. Yet, this is often a monotonous task. Some notions, such as equality, are very regular regardless if it is being encoded for a ground type or a type constructor.
In this paper we present a technique that unifies the treatment of ground types and type constructors whenever possible. This reduces code duplication and improves consistency. We discuss the encoding of several classes in this form, including the generic programming facility in GHC.
Mon 14 Jan Times are displayed in time zone: Greenwich Mean Time : Belfast change
|16:00 - 16:30|
|Faster Coroutine Pipelines: A Reconstruction|
|16:30 - 17:00|
|Distributed Protocol Combinators|
Kristoffer Just Arndal AndersenAarhus University, Ilya SergeyYale-NUS College and National University of SingaporePre-print
|17:00 - 17:30|
|Classes of Arbitrary Kind|
Alejandro SerranoUtrecht University, Netherlands, Victor Cacciari MiraldoUtrecht University, NetherlandsLink to publication DOI File Attached