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...
| Egile nagusia: | |
|---|---|
| Formatua: | Conference item |
| Argitaratua: |
Springer−Verlag
1995
|
| _version_ | 1826297339269087232 |
|---|---|
| author | Gibbons, J |
| author_facet | Gibbons, J |
| author_sort | Gibbons, J |
| collection | OXFORD |
| description | 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. <p> We show how to model a particular kind of directed acyclic graph using this initial-algebra approach.</p> |
| first_indexed | 2024-03-07T04:30:05Z |
| format | Conference item |
| id | oxford-uuid:cdfd12d7-d7e0-4ff4-a40d-bc3cae101c77 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T04:30:05Z |
| publishDate | 1995 |
| publisher | Springer−Verlag |
| record_format | dspace |
| spelling | oxford-uuid:cdfd12d7-d7e0-4ff4-a40d-bc3cae101c772022-03-27T07:32:43ZAn Initial−Algebra Approach to Directed Acyclic GraphsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:cdfd12d7-d7e0-4ff4-a40d-bc3cae101c77Department of Computer ScienceSpringer−Verlag1995Gibbons, JThe 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. <p> We show how to model a particular kind of directed acyclic graph using this initial-algebra approach.</p> |
| spellingShingle | Gibbons, J An Initial−Algebra Approach to Directed Acyclic Graphs |
| title | An Initial−Algebra Approach to Directed Acyclic Graphs |
| title_full | An Initial−Algebra Approach to Directed Acyclic Graphs |
| title_fullStr | An Initial−Algebra Approach to Directed Acyclic Graphs |
| title_full_unstemmed | An Initial−Algebra Approach to Directed Acyclic Graphs |
| title_short | An Initial−Algebra Approach to Directed Acyclic Graphs |
| title_sort | initial algebra approach to directed acyclic graphs |
| work_keys_str_mv | AT gibbonsj aninitialalgebraapproachtodirectedacyclicgraphs AT gibbonsj initialalgebraapproachtodirectedacyclicgraphs |