Datatype-Generic Programming: International Spring School, SSDGP 2006, Nottingham, UK, April 24-27, 2006, Revised Lectures
Roland Backhouse, Jeremy Gibbons, Ralf Hinze, Johan Jeuring
Springer Science & Business Media, Nov 30, 2007 - Computers - 367 pages
A leitmotif in the evolution of programming paradigms has been the level and extent of parametrisation that is facilitated — the so-called genericity of the paradigm. The sorts of parameters that can be envisaged in a programming language range from simple values, like integers and ?oating-point numbers, through structured values, types and classes, to kinds (the type of types and/or classes).Datatype-generic programming is about parametrising programsby the structure of the data that they manipulate. Toappreciatethe importanceofdatatypegenericity,oneneedlooknofurther than the internet. The internet is a massive repository of structured data, but the structure is rarely exploited. For example, compression of data can be much more e?ective if its structure is known, but most compression algorithms regard the input data as simply a string of bits, and take no account of its internal organisation. Datatype-genericprogrammingisaboutexploitingthestructureofdatawhen it is relevant and ignoring it when it is not. Programming languages most c- monly used at the present time do not provide e?ective mechanisms for do- menting and implementing datatype genericity. This volume is a contribution towards improving the state of the art. The emergence of datatype genericity can be traced back to the late 1980s.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstract algebraic datatypes apply approach Bifunctor binary Bool Btree Char construction content models data structure data type datatype Datatype-Generic Programming decodes deﬁne deﬁnition dependent types derived diﬀerent eﬀects Elcf element declarations element names encode example Expr Int ﬁeld ﬁrst fmap foldL Functional Programming functors GADTs Haskell’s Heidelberg higher-order Hinze idiom Impedance Mismatch implementation instance integers Iterator Jeuring kind-indexed L¨oh LINQ List LNCS monadic natural numbers nested newtype Node object model object types operator option Pair parametric polymorphism parametrized pattern polymorphic PolyP polytypic pretty programming language public class recursive reﬂection representation type Section speciﬁc Springer String Template Haskell toSpine traverse Tree Int type arguments type class type constructor type representation type signature type system type-indexed types of kind X-to-O mapping XML schema xs:complexType xs:element xs:sequence Zero