Academic
Publications
Data Structures and Program Transformation

Data Structures and Program Transformation,10.1016/0167-6423(90)90023-7,Science of Computer Programming,Grant Malcolm

Data Structures and Program Transformation   (Citations: 109)
BibTex | RIS | RefWorks Download
Journal: Science of Computer Programming - SCP , vol. 14, no. 2-3, pp. 255-279, 1990
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ... between data types and their specific properties have already been investigated very well to describe certain recursion patterns.Backhouse et al. introduce them in the context of generic programming [1], [14] Meijer et al., for example, have described several morphisms on inductive data types [14], Hutton gives a good tutorial on fold [8], and Malcolm generalises morphisms to arbitrary, inductively defined algebraic data types [13]...
    • ...Malcolm [13] to a concrete application, we plan to generalise the detection of catamorphisms to arbitrary algebraic data types as, e.g., Peano integers or trees, hoping that we can achieve the shown complexity reduction on other data types, too...

    Martin Hofmannet al. I/O guided detection of list catamorphisms: towards problem specific u...

    • ...Building on the work of Hagino [17], Malcolm [23] and many others, Bird and de Moor gave a comprehensive account of the “Algebra of Programming” in their seminal textbook [3]...
    • ...Building on the notions of functors and natural transformations Malcolm generalised the Bird-Meertens formalism to arbitrary datatypes [23]...

    Ralf Hinze. Adjoint Folds and Unfolds

    • ...The above sketched computational interpretations of induction and coinduction and more general recursive schemes can be derived from category-theoretic considerations using the initial algebra/final coalgebra interpretation of least and greatest fixed points (see for example [18,19,20,21])...

    Ulrich Berger. From Coinductive Proofs to Exact Real Arithmetic

    • ...Using concepts from category theory, in particular functors and functor-algebras, this work was generalized by Grant Malcolm in Groningen [12] and others to programming laws on arbitrary datatypes...

    Johan Jeuringet al. Geniaal programmeren { Generic programming at Utrecht

    • ...Denition 2 makes use of the \banana brackets", ([ ]), introduced by Malcolm [25, 26] to denote a functional/relational catamorphism...

    Roland Carl Backhouseet al. Datatype-Generic Termination Proofs

Sort by: