Results 31 to 40 of about 623,637 (299)
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Theoretical Computer Science, 1991 We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of infinitary theories.
Dershowitz, Nachum +2 more
openaire +1 more source
Fééries, 2019 In this article an intertextual approach to literature is adopted to understand how the western canon has come to acquire a physiognomy defined by the permanence and the metamorphosis of founding literary texts and by their circulation, reception and ...
Isabella Mattazzi
doaj +1 more source
Criticón, 2016 In this paper I will prove that La palabra vengada, a play published in 1678 under the name of Fernando de Zárate (pseudonym of Antonio Enríquez Gómez) and attributed by critics to Lope de Vega, is in fact a reworking by Antonio Enríquez Gómez of a play ...
Daniel Fernández Rodríguez
doaj +1 more source
Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations [PDF]
, 2014 We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes.
A. Finkel +16 more
core +1 more source
Thermodynamic graph-rewriting [PDF]
Logical Methods in Computer Science, 2013 We develop a new thermodynamic approach to stochastic graph-rewriting. The ingredients are a finite set of reversible graph-rewriting rules called generating rules, a finite set of connected graphs P called energy patterns and an energy cost function. The idea is that the generators define the qualitative dynamics, by showing which transformations are ...
Danos, Vincent +3 more
openaire +9 more sources
Robes classiques et robes symbolistes, de « Peau d’Âne » aux avatars de « Barbe bleue »
Fééries, 2019 To answer the question of the treatment of the material world in fairy tales, this paper first considers how Perrault represents the three marvelous dresses of “Peau d’Âne” and which part they play in her relationship with her father and her lover. Then,
Jean-Paul Sermain
doaj +1 more source
Can You Unpack That? Learning to Rewrite Questions-in-Context
Conference on Empirical Methods in Natural Language Processing, 2019 Question answering is an AI-complete problem, but existing datasets lack key elements of language understanding such as coreference and ellipsis resolution.
Ahmed Elgohary +2 more
semanticscholar +1 more source
A Constructor-Based Reachability Logic for Rewrite Theories [PDF]
International Workshop/Symposium on Logic-based Program Synthesis and Transformation, 2017 Reachability logic has been applied to 𝕂 rewrite-rule-based language definitions as a language-generic logic of programs to verify a wide range of sophisticated programs in conventional languages. Here we study how reachability logic can be made not just
Stephen Skeirik +2 more
semanticscholar +1 more source
Signum: Estudos da Linguagem, 2017 In this article, we analyze the work with the rewriting in higher education, with regard to the operations employed, and the meanings produced from the changes made in the text.
Lidiane de Morais Diógenes Bezerra
doaj +1 more source
Refinement Types as Higher Order Dependency Pairs [PDF]
, 2010 Refinement types are a well-studied manner of performing in-depth analysis on functional programs. The dependency pair method is a very powerful method used to prove termination of rewrite systems; however its extension to higher order rewrite systems is
Roux, Cody
core +10 more sources