Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Data Structure
Program Transformation
Related Publications
(30)
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
An introduction to the theory of lists
A Tutorial on the Universality and Expressiveness of Fold
Generic Programming: An Introduction
A Typed Lambda Calculus with Categorical Type Constructors
Subscribe
Academic
Publications
Data Structures and Program Transformation
Data Structures and Program Transformation,10.1016/01676423(90)900237,Science of Computer Programming,Grant Malcolm
Edit
Data Structures and Program Transformation
(
Citations: 109
)
BibTex

RIS

RefWorks
Download
Grant Malcolm
Journal:
Science of Computer Programming  SCP
, vol. 14, no. 23, pp. 255279, 1990
DOI:
10.1016/01676423(90)900237
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.
(
linkinghub.elsevier.com
)
(
www.informatik.unitrier.de
)
Citation Context
(61)
... 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 Hofmann
,
et 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 BirdMeertens 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 categorytheoretic 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 functoralgebras, this work was generalized by Grant Malcolm in Groningen [
12
] and others to programming laws on arbitrary datatypes...
Johan Jeuring
,
et 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 Backhouse
,
et al.
DatatypeGeneric Termination Proofs
References
(1)
The promotion and accumulation strategies in transformational programming
(
Citations: 110
)
Richard S. Bird
Journal:
ACM Transactions on Programming Languages and Systems  TOPLAS
, vol. 6, no. 4, pp. 487504, 1984
Sort by:
Citations
(109)
Categorial Compositionality III: F(co)algebras and the Systematicity of Recursive Capacities in Human Cognition
Steven Phillips
,
William H. Wilson
Journal:
PLOS One
, vol. 7, no. 4, 2012
I/O guided detection of list catamorphisms: towards problem specific use of program templates in IP
(
Citations: 3
)
Martin Hofmann
,
Emanuel Kitzelmann
Conference:
Partial Evaluation and SemanticBased Program Manipulation  PEPM
, pp. 93100, 2010
Adjoint Folds and Unfolds
(
Citations: 2
)
Ralf Hinze
Conference:
Mathematics of Program Construction  MPC
, pp. 195228, 2010
Factorising folds for faster functions
Graham Hutton
,
Mauro Jaskelioff
,
Andy Gill
Journal:
Journal of Functional Programming  JFP
, vol. 20, no. 34, pp. 353373, 2010
Generic programming with fixed points for mutually recursive datatypes
(
Citations: 9
)
Alexey Rodriguez Yakushev
,
Stefan Holdermans
,
Andres Löh
,
Johan Jeuring
Conference:
International Conference on Functional Programming  ICFP
, pp. 233244, 2009