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...
Autor principal: | Gibbons, J |
---|---|
Formato: | Conference item |
Publicado em: |
Springer−Verlag
1995
|
Registos relacionados
-
Combinatorics of acyclic orientations of graphs : algebra, geometry and probability
Por: Iriarte Giraldo, Benjamin
Publicado em: (2015) -
Broadcasting on Random Directed Acyclic Graphs
Por: Makur, Anuran, et al.
Publicado em: (2021) -
Throughput-optimal broadcast on directed acyclic graphs
Por: Sinha, Abhishek, et al.
Publicado em: (2015) -
Evaluating topological ordering in directed acyclic graphs
Por: Suzana Antunović, et al.
Publicado em: (2021-10-01) -
Reducing bias through directed acyclic graphs
Por: Platt Robert W, et al.
Publicado em: (2008-10-01)