Name
Abstract | ||
|---|---|---|
The representational theorem for fork algebras was always misunderstood regarding its applications in program construction. Its application was always described as 'the portability of properties of the problem domain into the abstract calculus of fork algebras'. In this paper we show that the results provided by the representation theorem are by far more important. We show that not only the heuris... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1093/jigpal/6.2.227 | Logic Journal of the IGPL |
Keywords | Field | DocType |
Fork algebras,program construction,algorithm design strategies | Fork (system call),Discrete mathematics,Algebra,Software construction,Mathematics | Journal |
Volume | Issue | ISSN |
6 | 2 | 1367-0751 |
Citations | PageRank | References |
2 | 0.53 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcelo F. Frias | 1 | 295 | 35.57 |
| Gabriel Baum | 2 | 50 | 14.69 |
| Armando Martin Haeberer | 3 | 81 | 11.05 |