An Initial-Algebra Approach to Directed Acyclic Graphs

An Initial-Algebra Approach to Directed Acyclic Graphs (1995)

Cached

Download Links

[www.cs.auckland.ac.nz]
[uebb.cs.tu-berlin.de]

Other Repositories/Bibliography

DBLP

by Jeremy Gibbons , Jeremy Gibbons

Citations:

4 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	An Initial-Algebra Approach to Directed Acyclic Graphs	user correction - Legacy Corrections
AUTHOR NAME	Jeremy Gibbons	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; University of Auckland	SVM HeaderParse 0.2
AUTHOR ADDR	Private Bag 92019, Auckland, New Zealand.	SVM HeaderParse 0.2
AUTHOR NAME	Jeremy Gibbons	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; University of Auckland	SVM HeaderParse 0.2
AUTHOR ADDR	Private Bag 92019, Auckland, New Zealand.	SVM HeaderParse 0.2
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 di#erentways of constructing the same object. The recursive decomposition of objects of the datatype leads directly to a recursive pattern of computation on those objects, whichisvery helpful for both functional and parallel programming. We showhow to model a particular kind of directed acyclic graph using this initial-algebra approach. Keywords. Graphs, data types, catamorphisms, initial algebras, Bird-Meertens Formalism, program derivation. 1 Introduction It is now widely recognized that the traditional ad-hoc approaches to program construction do not yield reliable software; a more systematic and formal approach is required. One such approach consists of program veri#cation---proving after the fact that a given program satis#es its formal speci#cation. This approach turns out to be di#cult to implement, not lea...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	30 found	ParsCit 1.0