Abstract
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2nd ACM SIGPLAN symposium on Haskell |
| Place of Publication | New York |
| Publisher | Association for Computing Machinery (ACM) |
| Pages | 105-116 |
| Number of pages | 12 |
| ISBN (Print) | 9781605585086 |
| DOIs | |
| Publication status | Published - 3 Sep 2009 |
| Event | 2nd ACM SIGPLAN symposium on Haskell3/9/2003 - Edinburgh, United Kingdom Duration: 3 Sep 2009 → 3 Sep 2009 Conference number: 2nd |
Other
| Other | 2nd ACM SIGPLAN symposium on Haskell3/9/2003 |
|---|---|
| Abbreviated title | Haskell 2009 |
| Country | United Kingdom |
| City | Edinburgh |
| Period | 3/09/09 → 3/09/09 |
Cite this
}
Alloy : fast generic transformations for Haskell. / Brown, Neil C.C.; Sampson, Adam T.
Proceedings of the 2nd ACM SIGPLAN symposium on Haskell. New York : Association for Computing Machinery (ACM), 2009. p. 105-116.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Alloy
T2 - fast generic transformations for Haskell
AU - Brown, Neil C.C.
AU - Sampson, Adam T.
PY - 2009/9/3
Y1 - 2009/9/3
N2 - Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Generic programming is often approached from a theoretical perspective, where the emphasis lies on the power of the representation rather than on efficiency. We describe use cases for a generic system derived from our work on a nanopass compiler, where efficiency is a real concern, and detail a new generics approach (Alloy) that we have developed in Haskell to allow our compiler passes to traverse the abstract syntax tree quickly. We benchmark our approach against several other Haskell generics approaches and statistically analyse the results, finding that Alloy is fastest on heterogeneously-typed trees.
AB - Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Generic programming is often approached from a theoretical perspective, where the emphasis lies on the power of the representation rather than on efficiency. We describe use cases for a generic system derived from our work on a nanopass compiler, where efficiency is a real concern, and detail a new generics approach (Alloy) that we have developed in Haskell to allow our compiler passes to traverse the abstract syntax tree quickly. We benchmark our approach against several other Haskell generics approaches and statistically analyse the results, finding that Alloy is fastest on heterogeneously-typed trees.
U2 - 10.1145/1596638.1596652
DO - 10.1145/1596638.1596652
M3 - Conference contribution
SN - 9781605585086
SP - 105
EP - 116
BT - Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
PB - Association for Computing Machinery (ACM)
CY - New York
ER -