Conference item
An Initial−Algebra Approach to Directed Acyclic Graphs
- 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.
Actions
Authors
Bibliographic Details
- Publisher:
- Springer−Verlag
- Host title:
- Mathematics of Program Construction
- Volume:
- 947
- Publication date:
- 1995-01-01
Item Description
- UUID:
-
uuid:cdfd12d7-d7e0-4ff4-a40d-bc3cae101c77
- Local pid:
- cs:2341
- Deposit date:
- 2015-03-12
Terms of use
- Copyright date:
- 1995
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record