Didier Caucal. An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes. In Hartmut Ehrig, Hans-Jörg Kreowski, Grzegorz Rozenberg, editors, Graph-Grammars and Their Application to Computer Science, 4th International Workshop, Bremen, Germany, March 5-9, 1990, Proceedings. Volume 532 of Lecture Notes in Computer Science, pages 190-206, Springer, 1990.
@inproceedings{Caucal90:1,
title = {An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes},
author = {Didier Caucal},
year = {1990},
tags = {redundancy, graph-rewriting, rewriting, grammar},
researchr = {https://researchr.org/publication/Caucal90%3A1},
cites = {0},
citedby = {0},
pages = {190-206},
booktitle = {Graph-Grammars and Their Application to Computer Science, 4th International Workshop, Bremen, Germany, March 5-9, 1990, Proceedings},
editor = {Hartmut Ehrig and Hans-Jörg Kreowski and Grzegorz Rozenberg},
volume = {532},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-54478-X},
}