International audienceThis 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
Following the experience of Elan, the Tom language was devel- oped to provide rewrite tools for impl...
The notion of an abstract syntax is discussed. An algorithm is presented for automatically deriving ...
Syntax trees are a very common data structure in language related tools. For example, compilers, int...
AbstractThis paper presents GOM, a language for describing abstract syntax trees and generating a Ja...
This paper presents GOM, a language for describing abstract syntax trees and generating a Java imple...
AbstractThis paper describes how an Abstract Programming Interface (api) and its implementation can ...
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to sim...
This thesis presents an object-oriented technique for rewriting abstract syntax trees in order to si...
International audienceTraversing and transforming abstract syntax trees that involve name binding is...
We propose a framework, syntactic theory functors (STFs), for creating syntactic structuring mechani...
Abstract syntax trees are a very common data-structure in language related tools. For example compil...
International audienceWe present the Tom language that extends Java with the purpose ofproviding hig...
Frequently source code analysis tools need to exchange internal representations of abstract syntax t...
When writing programs to manipulate structures such as algebraic expressions, logical formulas, proo...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
Following the experience of Elan, the Tom language was devel- oped to provide rewrite tools for impl...
The notion of an abstract syntax is discussed. An algorithm is presented for automatically deriving ...
Syntax trees are a very common data structure in language related tools. For example, compilers, int...
AbstractThis paper presents GOM, a language for describing abstract syntax trees and generating a Ja...
This paper presents GOM, a language for describing abstract syntax trees and generating a Java imple...
AbstractThis paper describes how an Abstract Programming Interface (api) and its implementation can ...
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to sim...
This thesis presents an object-oriented technique for rewriting abstract syntax trees in order to si...
International audienceTraversing and transforming abstract syntax trees that involve name binding is...
We propose a framework, syntactic theory functors (STFs), for creating syntactic structuring mechani...
Abstract syntax trees are a very common data-structure in language related tools. For example compil...
International audienceWe present the Tom language that extends Java with the purpose ofproviding hig...
Frequently source code analysis tools need to exchange internal representations of abstract syntax t...
When writing programs to manipulate structures such as algebraic expressions, logical formulas, proo...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
Following the experience of Elan, the Tom language was devel- oped to provide rewrite tools for impl...
The notion of an abstract syntax is discussed. An algorithm is presented for automatically deriving ...
Syntax trees are a very common data structure in language related tools. For example, compilers, int...