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 recu...
Auteur principal: | Gibbons, J |
---|---|
Format: | Conference item |
Publié: |
Springer−Verlag
1995
|
Documents similaires
-
Combinatorics of acyclic orientations of graphs : algebra, geometry and probability
par: Iriarte Giraldo, Benjamin
Publié: (2015) -
Broadcasting on Random Directed Acyclic Graphs
par: Makur, Anuran, et autres
Publié: (2021) -
Throughput-optimal broadcast on directed acyclic graphs
par: Sinha, Abhishek, et autres
Publié: (2015) -
Evaluating topological ordering in directed acyclic graphs
par: Suzana Antunović, et autres
Publié: (2021-10-01) -
Reducing bias through directed acyclic graphs
par: Platt Robert W, et autres
Publié: (2008-10-01)