Abstract
Generic traversals over recursive data structures are often referred to as boilerplate code. The definitions of functions involving such traversals may repeat very similar patterns, but with variations for different data types and different functionality. Libraries of operations abstracting away boilerplate code typically rely on elaborate types to make operations generic. The motivating observation for this paper is that most traversals have value-specific behaviour for just one type. We present the design of a new library exploiting this assumption. Our library allows concise expression of traversals with competitive performance.
Cite
CITATION STYLE
Mitchell, N., & Runciman, C. (2007). Uniform boilerplate and list processing (pp. 49–60). Association for Computing Machinery (ACM). https://doi.org/10.1145/1291201.1291208
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.