Results 31 to 40 of about 333,009 (323)
Rewriting in Free Hypergraph Categories [PDF]
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius structures ...
Fabio Zanasi
doaj +1 more source
Generic Encodings of Constructor Rewriting Systems [PDF]
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages, with the ...
Avanzini Martin +10 more
core +4 more sources
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems [PDF]
We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity.
Aart Middeldorp +10 more
core +4 more sources
Reversible Computation in Term Rewriting [PDF]
Essentially, in a reversible programming language, for each forward computation from state $S$ to state $S'$, there exists a constructive method to go backwards from state $S'$ to state $S$.
76074 +5 more
core +3 more sources
Rewriting Logic Semantics of a Plan Execution Language [PDF]
The Plan Execution Interchange Language (PLEXIL) is a synchronous language developed by NASA to support autonomous spacecraft operations. In this paper, we propose a rewriting logic semantics of PLEXIL in Maude, a high-performance logical engine.
A. Verdejo +25 more
core +4 more sources
Remakes and Remakers from the Perspective of Translatıon Studies
Since the early days of Turkish television, which profoundly affects societal engagement in Turkish culture, television (TV) series garner a sizeable audience and a significant share of total airtime is TV series (“dizi” in Turkish).
Mehmet Erguvan
doaj +1 more source
A coherence theorem for pseudonatural transformations [PDF]
We prove coherence theorems for bicategories, pseudofunctors and pseudonatural transformations. These theorems boil down to proving the coherence of some free $(4,2)$-categories.
Lucas, Maxime
core +6 more sources
Rule Algebras for Adhesive Categories [PDF]
We demonstrate that the most well-known approach to rewriting graphical structures, the Double-Pushout (DPO) approach, possesses a notion of sequential compositions of rules along an overlap that is associative in a natural sense.
Behr, Nicolas, Sobocinski, Pawel
core +2 more sources
A group \(G\) is said to have the \(n\)-rewritable property \(Q_n\) if for all elements \(g_1,g_2,\dots,g_n\in G\), there exist two distinct permutations \(\sigma\) and \(\tau\in\text{Sym}_n\) such that \[ g_{\sigma(1)}g_{\sigma(2)}\cdots g_{\sigma(n)}=g_{\tau(1)}g_{\tau(2)}\cdots g_{\tau(n)}. \] For a group \(G\), \(\Delta(G)\) is the set of elements \
Elashiry, M.I., Passman, D.S.
openaire +1 more source
Secure Querying of Recursive XML Views: A Standard XPath-based Technique [PDF]
Most state-of-the art approaches for securing XML documents allow users to access data only through authorized views defined by annotating an XML grammar (e.g. DTD) with a collection of XPath expressions.
Imine, Abdessamad, Mahfoud, Houari
core +6 more sources

