A well-written paper that explains some interesting ideas.
Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with potentially different implementations in each case. [...] A commonly requested extension [...] has many potentially useful applications. [...] A particular novelty of this paper is the application of ideas from the theory of relational detabases to th edesign of type systems.
I think you could understand and enjoy (much of) this even if you don't know Haskell. Apart from the technical ideas it includes a survey of other approaches that illustrates the kind of thing computer scientists spend their time thinking about and how current type systems are progressing. A great paper!
Posted to theory by andrew cooke on 4/16/01; 1:47:39 AM
|