More Flexible Term Schematisations via Extended Primal Grammars
نویسندگان
چکیده
We propose an extension of primal grammars (Hermann & Galbavý 1997). Primal grammars are term grammars with a high expressive power and good computational properties. The extended grammars have exactly the same properties but are more modular, more concise, and easier to use, as shown by some examples. An algorithm transforming any extended primal grammar into an equivalent primal grammar is provided.
منابع مشابه
On the Relation Between Primitive Recursion, Schematization and Divergence
The paper presents a new schematization of innnite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is presented by a generating term and a canonical rewrite system. It is proved that the class of primal grammars covers completely the class of crossed rewrite systems. This proof contains a construction of a primal gram...
متن کاملUnification of Infinite Sets of Terms Schematized by Primal Grammars
Innnite sets of terms appear frequently at diierent places in computer science. On the other hand, several practically oriented parts of logic and computer science require the manipulated objects to be nite or nitely representable. Schematizations present a suitable formalism to manipulate nitely innnite sets of terms. Since schematizations provide a diierent approach to solve the same kind of ...
متن کاملA Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars
Tree languages are powerful tools for the representation and schematization of infinite sets of terms for various purposes (unification theory, verification and specification ...). In order to extend the regular tree language framework, more complex formalisms have been developed. In this paper, we focus on Tree Synchronized Grammars and Primal Grammars which introduce specific control structur...
متن کاملA Flexible Primal-Dual Toolbox
FlexBox is a flexible MATLAB toolbox for finite dimensional convex variational problems in image processing and beyond. Such problems often consist of non-differentiable parts and involve linear operators. The toolbox uses a primal-dual scheme to avoid (computationally) inefficient operator inversion and to get reliable error estimates. From the user-side, FlexBox expects the primal formulation...
متن کاملStone Soup Translation ∗
The automated translation of one natural language to another, known as machine translation, typically requires successful modeling of the grammars of the two languages and of the relationship between them. Rather than hand-coding these grammars and relationships, some machine translation efforts have begun to employ statistical methods, where the goal is to learn from a large amount of training...
متن کامل