Name
Abstract | ||
|---|---|---|
The representation 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. Here we show that not only the heuristic power coming from concrete binary relations is captured inside the abstract calculus, but also design strategies for program development can be successfully expressed. This result makes fork algebras a programming calculus by far more powerful than it was previously thought. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/3-540-62064-8_19 | Ershov Memorial Conference |
Keywords | Field | DocType |
design strategies,fork algebras,binary relation | Fork (system call),Heuristic,Problem domain,Algebra,Binary relation,Computer science,Representation theorem,Software portability,Software construction,Relation algebra | Conference |
ISBN | Citations | PageRank |
3-540-62064-8 | 0 | 0.34 |
References | Authors | |
5 | 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 |