Canonical Abstract Syntax Trees

Antoine Reilles 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00000967
Contributor : Antoine Reilles <>
Submitted on : Monday, November 20, 2006 - 5:06:16 PM
Last modification on : Thursday, January 11, 2018 - 6:19:57 AM
Long-term archiving on : Monday, September 20, 2010 - 4:29:43 PM

Files

gomfinal.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Antoine Reilles. Canonical Abstract Syntax Trees. 6th International Workshop on Rewriting Logic and Applications - WRLA 2006, Carolyn Talcott and Grit Denker, Apr 2006, Vienna, Austria. ⟨inria-00000967v2⟩

Share

Metrics

Record views

248

Files downloads

259