Todd A. Proebsting. BURG, IBURG, WBURG, GBURG: so many trees to rewrite, so little time ::::(invited talk)::::. In Bernd Fischer, Eelco Visser, editors, Proceedings of the 2002 ACM SIGPLAN Workshop on Rule-Based Programming, Pittsburgh, Pennsylvania, USA, 2002. pages 53-54, ACM, 2002. [doi]
@inproceedings{Proebsting02,
title = {BURG, IBURG, WBURG, GBURG: so many trees to rewrite, so little time ::::(invited talk)::::},
author = {Todd A. Proebsting},
year = {2002},
doi = {10.1145/570186.570191},
url = {http://doi.acm.org/10.1145/570186.570191},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Proebsting02},
cites = {0},
citedby = {0},
pages = {53-54},
booktitle = {Proceedings of the 2002 ACM SIGPLAN Workshop on Rule-Based Programming, Pittsburgh, Pennsylvania, USA, 2002},
editor = {Bernd Fischer and Eelco Visser},
publisher = {ACM},
isbn = {1-58113-606-4},
}