Algebraic specialization of generic functions for recursive types
Defining functions over large, possibly recursive, data structures usually involves a lot of boilerplate. This code simply traverses non-interesting parts of the data, and rapidly becomes a maintainability problem. Many generic programming libraries have been proposed to address this issue. Most of...
Main Author: | |
---|---|
Other Authors: | |
Format: | article |
Language: | eng |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/1822/14888 |
Country: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/14888 |