Abstract Normal Form for Grammars in a Broad Sense

A normal form is proposed for abstract grammars in a broad sense (abstract syntaxes, algebraic signatures, algebraic data types, object models, XML schemata, software metamodels, etc). An equivalence relation based on this normal form drastically simplifies the process of matching such grammars modulo their constructor and argument names, as well as matching abstract and concrete definitions of the same intended software language.

This paper is submitted to IPL and is currently under review.