Abstract
This paper presents GOM, a language for describing abstract syntax trees and generating a Java implementation for those trees. GOM includes features allowing the user to specify and modify the interface of the data structure. These features provide in particular the capability to maintain the internal representation of data in canonical form with respect to a rewrite system. This explicitly guarantees that the client program only manipulates normal forms for this rewrite system, a feature which is only implicitly used in many implementations.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-171

BibTeX:

@inproceedings{REWERSE-RP-2006-171,
	author = {Antoine Reilles},
	title = {Canonical Abstract Syntax Trees},
	booktitle = {Proceedings of 6th International Workshop on Rewriting Logic and its Applications, Vienna, Austria (1st--2nd April 2006)},
	year = {2006},
	volume = {176},
	number = {4},
	series = {ENTCS},
	pages = {165--179},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-171}
}