An initial-algebra approach to directed acyclic graphs

Show simple item record Gibbons, Jenny en 2009-04-14T23:08:28Z en 2009-04-14T23:08:28Z en 1995-04 en
dc.identifier.citation CDMTCS Research Report Series CDMTCS-001 (1995) en
dc.identifier.uri en
dc.description.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 initial-algebra approach. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights.uri en
dc.source.uri en
dc.title An initial-algebra approach to directed acyclic graphs en
dc.type Technical Report en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder The author(s) en
dc.rights.accessrights en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace