An Initial−Algebra Approach to Directed Acyclic Graphs
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.
- Host title:
- Mathematics of Program Construction
- Publication date:
- Local pid:
- Deposit date:
- Copyright date:
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record