Loading...
Please wait, while we are loading the content...
Higher-order Catamorphisms as Bases for Program Structuring and Design Recovery
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bailes, Paul A. Brough, Leighton Kemp, Colin J. M. |
| Copyright Year | 2013 |
| Abstract | Catamorphisms ("foldr" on lists, but generally applicable to any regular recursive datatype) are not just useful but are an effective basis for a recursion-pattern-based discipline of program design. A new presentation for catamorphisms makes it clear how they provide functional semantics for symbolic datatypes, with the capacity to expose significant variations in program design. A further development of the new presentation exploits the higher-order capabilities of functional languages. This is the key enabler for a comprehensive replacement of symbolic data and their interpreters, either implicit or explicit, with direct functional representations. These extensions, of the applicability of catamorphisms and of their presentations, make them even more attractive as bases for program structuring and design, and likewise as targets for software reverse engineering and design recovery. |
| Starting Page | 775 |
| Ending Page | 782 |
| Page Count | 8 |
| File Format | PDF HTM / HTML |
| DOI | 10.2316/P.2013.796-015 |
| Journal | ICSE 2013 |
| Alternate Webpage(s) | http://www.actapress.com/PDFViewer.aspx?paperId=455453 |
| Alternate Webpage(s) | https://doi.org/10.2316/P.2013.796-015 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
