474,674 research outputs found
Rewrite, rewrite, rewrite, rewrite, rewrite, …
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. We also consider sufficient completeness of hierarchical systems
Rewrite
“Rewrite” is a photographic project that utilizes the domesstic space as a stage for emotional projection of a traumatic memory. The work considers the relationship that exists between an individual and the rooms and objects within a home space in an attempt at understanding an individual’s mental state. “Rewrite” explores the ways in which we exist through our home and how a juxtaposition of objects and materials can create meaning. The photographs are a visual interpretation of the emotions surrounding sexual abuse/assault/rape as they have related to my own personal history and conversations I have had with women close to me
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems
The general form of safe recursion (or ramified recurrence) can be expressed
by an infinite graph rewrite system including unfolding graph rewrite rules
introduced by Dal Lago, Martini and Zorzi, in which the size of every normal
form by innermost rewriting is polynomially bounded. Every unfolding graph
rewrite rule is precedence terminating in the sense of Middeldorp, Ohsaki and
Zantema. Although precedence terminating infinite rewrite systems cover all the
primitive recursive functions, in this paper we consider graph rewrite systems
precedence terminating with argument separation, which form a subclass of
precedence terminating graph rewrite systems. We show that for any precedence
terminating infinite graph rewrite system G with a specific argument
separation, both the runtime complexity of G and the size of every normal form
in G can be polynomially bounded. As a corollary, we obtain an alternative
proof of the original result by Dal Lago et al.Comment: In Proceedings TERMGRAPH 2014, arXiv:1505.06818. arXiv admin note:
text overlap with arXiv:1404.619
Confluence as a cut elimination property
The goal of this note is to compare two notions, one coming from the theory
of rewrite systems and the other from proof theory: confluence and cut
elimination. We show that to each rewrite system on terms, we can associate a
logical system: asymmetric deduction modulo this rewrite system and that the
confluence property of the rewrite system is equivalent to the cut elimination
property of the associated logical system. This equivalence, however, does not
extend to rewrite systems directly rewriting atomic propositions
Needed: A Rewrite
Proposed far-reaching changes in the Federal Rules of Evidence are of major practical significance to every lawyer involved in the criminal justice process. The proposed changes are contained in a recent report by the American Bar Association Criminal Justice Section\u27s Rules of Criminal Procedure and Evidence Committee. The report was selected for publication in Federal Rules Decisions, 120 F.R.D. 299 (1988), because of its interest to federal practitioners and judges. More than 40 judges, lawyers, and scholars were involved in the four-year study, and experts on each particular rule acted as reporters to the committee on those areas.
The report rewrites the rules on such important matters as prior convictions to impeach criminal defendants, expert testimony, character evidence, shielding rape victims, presumptions, child witnesses in violence and sex abuse cases, jurors impugning their own verdicts, competency, judicial notice, judicial comment, and admissibility of pleas, plea discussions, and related statements
On prefixal one-rule string rewrite systems
International audiencePrefixal one-rule string rewrite systems are one-rule string rewrite systems for which the left-hand side of the rule is a prefix of the right-hand side of the rule. String rewrite systems induce a transformation over languages: from a starting word, one can associate all its descendants. We prove, in this work, that the transformation induced by a prefixal one-rule rewrite system always transforms a finite language into a context-free language, a property that is surprisingly not satisfied by arbitrary one-rule rewrite systems. We also give here a decidable characterization of the prefixal one-rule rewrite systems whose induced transformation is a rational transduction
Using groups for investigating rewrite systems
We describe several technical tools that prove to be efficient for
investigating the rewrite systems associated with a family of algebraic laws,
and might be useful for more general rewrite systems. These tools consist in
introducing a monoid of partial operators, listing the monoid relations
expressing the possible local confluence of the rewrite system, then
introducing the group presented by these relations, and finally replacing the
initial rewrite system with a internal process entirely sitting in the latter
group. When the approach can be completed, one typically obtains a practical
method for constructing algebras satisfying prescribed laws and for solving the
associated word problem
- …