See this document in CiteSeerX!

An Initial-Algebra Approach to Directed Acyclic Graphs (1995)  (Make Corrections)  (5 citations)
Jeremy Gibbons
Proceedings 3rd Int.\ Conf.\ on Mathematics of Program Construction, MPC'95, Kloster Irsee, Germany, 17--21 July 1995



  Home/Search   Context   Related

 
View or download:
cs.auckland.ac.nz/out/jer...damgs.ps.gz
uebb.cs.tuberlin.d...initialDAG.ps.gz
web.comlab.ox.ac.uk/oucl/...damgs.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  hypatia.dcs.qmw...nctional.pearls (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . The initial-algebra approach to modelling datatypes consists of giving constructors for building larger objects of that type from smaller ones, and laws identifying different ways of constructing the same object. The recursive decomposition of objects of the datatype leads directly to a recursive pattern of computation on those objects, which is very helpful for both functional and parallel programming. We show how to model a particular kind of directed acyclic graph using this... (Update)

Context of citations to this paper:   More

...folds for abstract data types has been almost neglected so far. Despite proposals for specific types, such as arrays [1] or graphs [8, 2], it is only Fokkinga [7] who attacks the problem from a general point of view. In his approach terms are represented by combinators,...

...it lacks efficiency since direct access to a node requires, in general, traversal of the whole graph. Also related is the work of Gibbons [11] who considers the definition of graph fold operations within an algebraic framework. But he deals only with acyclic graphs, and an...

Cited by:   More
Catamorphic Approach to Program Analysis - Ogawa, Hu, Sasano, Takeichi (2003)   (Correct)
Deriving Tidy Drawings of Trees - Gibbons (1995)   (Correct)
Calculating with Relations for Graph Algorithmics - Ravelo (1997)   (Correct)

Similar documents (at the sentence level):
52.1%:   An Initial-Algebra Approach to Directed Acyclic Graphs - Gibbons (1995)   (Correct)

Active bibliography (related documents):   More   All
0.8:   A Relational Approach To Optimization Problems - Curtis (1996)   (Correct)
0.5:   Relational Treatment of Term Graphs With Bound Variables - Kahl (1998)   (Correct)
0.4:   Chapter 4 Purity, Impurity and Efficiency in Graph Algorithms - Ri Th Ms   (Correct)

Similar documents based on text:   More   All
0.3:   How to Derive Tidy Drawings of Trees - Jeremy Gibbons Department   (Correct)
0.1:   Polytypic Downwards Accumulations - Gibbons (1998)   (Correct)
0.1:   Binary Structures In Program Transformations - Zantema (1988)   (Correct)

Related documents from co-citation:   More   All
3:   Revisiting Catamorphisms over Datatypes with Embedded Functions - Fegaras, Sheard - 1996
2:   Graph Algorithms with a Functional Flavour (context) - Launchbury - 1995
2:   A fold for all seasons - Sheard, Fegaras - 1993

BibTeX entry:   (Update)

J. Gibbons. An Initial Algebra Approach to Directed Acyclic Graphs. In Mathematics of Program Construction, LNCS 947, pages 282--303, 1995. http://citeseer.ist.psu.edu/article/gibbons95initialalgebra.html   More

@incollection{ gibbons95initialalgebra,
    author = "Jeremy Gibbons",
    title = "An Initial-Algebra Approach to Directed Acyclic Graphs",
    booktitle = "Proceedings 3rd Int.\ Conf.\ on Mathematics of Program Construction, {MPC}'95, Kloster Irsee, Germany, 17--21 July 1995",
    volume = "947",
    publisher = "Springer-Verlag",
    address = "Berlin",
    editor = "B. M{\"o}ller",
    pages = "122--138",
    year = "1995",
    url = "citeseer.ist.psu.edu/article/gibbons95initialalgebra.html" }
Citations (may not include all citations):
562   Categories for the Working Mathematician (context) - Lane - 1971
172   An introduction to the theory of lists (context) - Bird - 1987
138   Lectures on constructive functional programming (context) - Bird - 1988
104   Graph rewriting: An algebraic and logic approach (context) - Courcelle - 1990
81   Algorithmics: Towards programming as a mathematical activity (context) - Meertens - 1986
55   Foundations of Parallel Programming (context) - Skillicorn - 1994
53   Using circular programs to eliminate multiple traversals of .. (context) - Bird - 1984
23   Upwards and downwards accumulations on trees (context) - Gibbons - 1992
12   Manipulating multilinked data structures in a pure functiona.. (context) - Burton, Yang - 1990
12   Available as Technical Monograph PRG (context) - Gibbons, Tree et al. - 1991
9   First steps towards the theory of rose trees (context) - Meertens - 1988
9   Graph algorithms in a lazy functional programming language (context) - Kashiwagi, Wise - 1991
8   Derivation of graph and pointer algorithms (context) - Moller - 1993
7   Free net algebras in VLSI-theory (context) - Molitor - 1988
4   Deriving algorithms on binary labelled trees (context) - Jeuring - 1989
4   Shorter paths to graph algorithms (context) - Moller, Russling
4   Lazy depth-first search and linear graph algorithms in Haske.. - King, Launchbury - 1993
4   This article was processed using the L a T E X macro package.. (context) - Wright, of et al. - 1988
3   The derivation of hierarchies of algorithms on matrices (context) - Jeuring
2   Working Conference on Constructing Programs from Specificati.. (context) - Moller, TC - 1991
2   Interpretations of term graphs (context) - Paterson - 1994
2   The Boom hierarchy - Bunkenburg - 1993
2   LNCS 669: Mathematics of Program Construction (context) - Bird, Morgan et al. - 1993
2   and Jaap van der Woude (context) - Backhouse, de Bruin et al.
2   Algebraic calculation of graph and sorting algorithms (context) - Moller - 1993
1   Towards a new algebraic foundation of flowchart scheme theor.. (context) - Cazanescu, tefanescu - 1990
1   Classes of finite relations as initial abstract data types (context) - Cazanescu, tefanescu - 1991
1   Relational programming laws in the Boom hierarchy of types - Hoogendijk
1   Comment at IFIP Working Group (context) - Paige - 1994

Documents on the same site (http://hypatia.dcs.qmw.ac.uk/SEL-HPC/Articles/GeneratedHtml/functional.pearls.html):   More
The Third Homomorphism Theorem - Gibbons (1995)   (Correct)
Linear-time breadth-first tree algorithms: An exercise in the .. - Jones, Gibbons (1993)   (Correct)
How to Derive Tidy Drawings of Trees - Gibbons (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC