An initial-algebra approach to directed acyclic graphs

Gibbons, Jenny

dc.contributor.author	Gibbons, Jenny	en
dc.date.accessioned	2009-04-14T23:08:28Z	en
dc.date.available	2009-04-14T23:08:28Z	en
dc.date.issued	1995-04	en
dc.identifier.citation	CDMTCS Research Report Series CDMTCS-001 (1995)	en
dc.identifier.uri	http://hdl.handle.net/2292/3509	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	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	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	http://purl.org/eprint/accessRights/OpenAccess	en