Search results for "Rewriting"
showing 10 items of 39 documents
Tradition and rewrite: "El maestro de danzar", from Lope to Calderón
2018
Altres ajuts: FNS/00015_156044 En el presente artículo pretendo defender e ilustrar la influencia de El maestro de danzar, comedia de Lope de Vega, sobre la pieza homónima de Calderón, cuestión que ha suscitado opiniones dispares entre la crítica. Un análisis minucioso de ambos textos permite establecer paralelismos indiscutibles entre uno y otro, que ponen en evidencia la deuda de Calderón con el Fénix. Se detallan con precisión qué fragmentos se reescribieron y reutilizaron en la obra calderoniana, y se abordan asimismo las circunstancias y motivos que pudieron inducir a Calderón a llevar a cabo dicho proceso de reescritura, que el dramaturgo, lejos de ocultar, puso de manifiesto mediante…
Nondeterministic operations on finite relational structures
1998
Abstract This article builds on a tutorial introduction to universal algebra for language theory (Courcelle, Theoret. Comput. Sci. 163 (1996) 1–54) and extends it in two directions. First, nondeterministic operations are considered, i.e., operations which give a set of results instead of a single one. Most of their properties concerning recognizability and equational definability carry over from the ordinary case with minor modifications. Second, inductive sets of evaluations are studied in greater detail. It seems that they are handled most naturally in the framework presented here. We consider the analogues of top-down and bottom-up tree transducers. Again, most of their closure propertie…
Process specification and verification
1996
Graph grammars provide a very convenient specification tool for distributed systems of processes. This paper addresses the problem how properties of such specifications can be proven. It shows a connection between algebraic graph rewrite rules and temporal (trace) logic via the graph expressions of [2]. Statements concerning the global behavior can be checked by local reasoning.
Qu’est-ce qu’un conte pour enfant ? Les Casse-noisette de Hoffmann et Dumas
2019
Le conte Casse-noisette et le Roi des Rats de Hoffmann paraît initialement dans Les Frères de Saint-Sérapion, encadré par un débat sur ce qui fait la singularité d’un conte pour enfants. Le texte entre en France détaché du recueil originel ; il est réécrit par Dumas en 1844. La comparaison des versions de Hoffmann et Dumas permet de réfléchir à la nature problématique des contes pour enfants : le conte pourrait bien être en définitive un genre sur l’enfance.
Michael Field’s "Long ago" (1889) as a paradigm of intertextual theory: from strangeness to metaxology
2018
En el presente artículo, pretendemos abordar la pregunta de cómo Katherine Bradley y Edith Cooper articulan su íntimo diálogo con la poesía de Safo en su primer poemario, Long Ago (1889), publicado bajo el pseudónimo de Michael Field. La respuesta que proponemos para este interrogante se desarrolla en una profunda reflexión que interpreta Long Ago como un texto denso y audaz donde se revisa y se reubica la ontología del arte literario en posiciones ambivalentes. La conclusión primordial a que llegamos es que el poemario en sí representa todo un paradigma de teoría intertextual aplicada que propicia encuentros complejos, inestables y fértiles ente el inglés y el griego, lo traducible y lo su…
Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness
2018
We define a graph rewriting system that is easily understandable by humans, but rich enough to allow very general queries to molecule databases. It is based on the substitution of a single node in a node- and edge-labeled graph by an arbitrary graph, explicitly assigning new endpoints to the edges incident to the replaced node. For these graph rewriting systems, we are interested in the subgraph-matching problem. We show that the problem is NP-complete, even on graphs that are stars. As a positive result, we give an algorithm which is polynomial if both rules and query graph have bounded degree and bounded cut size. We demonstrate that molecular graphs of practically relevant molecules in d…
Inductive synthesis of term rewriting systems
2005
Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.
Automatic Reengineering in MDA Using Rewriting Logic as Transformation Engine
2005
Legacy systems are information systems that have been developed by means of methods, tools and database management systems that have become obsolete, but they are still being used due to their reliability. As time goes on, the maintenance of this software becomes more complex, expensive and painful. The MOMENT framework supports automatic formal model transformations in MDA. This model transformation approach is based on the algebraic specification of models and benefits from mature term rewriting system technology to perform model transformation using rewriting logic. In this paper, we present how we apply this formal transformation mechanism to recover a legacy relational database, obtain…
Il frammento riscritto. Su alcune citazioni tragiche ciceroniane
2016
The monody of Ennius'Andromacha represents for Cicero a poetic model and a source of inspiration. The quotations of the pro Sestio sound like imitation and rewriting
Transformation of UML models to CSP : a case study for graph transformation tools
2008
Graph transformation provides an intuitive mechanism for capturing model transformations. In the current paper, we investigate and compare various graph transformation tools using a compact practical model transformation case study carried out as part of the AGTIVE 2007 Tool Contest [22]. The aim of this case study is to generate formal CSP processes from high-level UML activity diagrams, which enables to carry out mathematical analysis of the system under design.