Results 31 to 40 of about 321,292 (267)
Rewriting in Free Hypergraph Categories [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 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
NJES: Nordic Journal of English studies, 2022 Nearly 1 in 50 in the US will be diagnosed with Autism Spectrum Disorder (ASD) (Dietz et al. 2020), while in Sweden, statistics oscillate around 1.5% (Linnsand et al. 2021).
Anna Justine Sochacka
doaj +1 more source
Rewriting Logic Semantics of a Plan Execution Language [PDF]
, 2010 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
Generic Encodings of Constructor Rewriting Systems [PDF]
, 2019 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 +5 more sources
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems [PDF]
, 2011 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
Controlling Rewriting by Rewriting
Electronic Notes in Theoretical Computer Science, 1996 AbstractIn this paper, we investigate the idea of controlling rewriting by strategies and we develop a strategy language whose operational semantics is also based on rewriting. This language is described in ELAN, a language based on computational systems that are simply rewriting theories controlled by strategies.
Borovanský, Peter +2 more
openaire +1 more source
Reversible Computation in Term Rewriting [PDF]
, 2017 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
Trajectory Codes for Flash Memory [PDF]
, 2010 Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the stored data changes its value with certain patterns.
Anxiao Jiang +5 more
core +5 more sources
Transforming Outermost into Context-Sensitive Rewriting [PDF]
Logical Methods in Computer Science, 2010 We define two transformations from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system.
Joerg Endrullis, Dimitri Hendriks
doaj +1 more source
Remakes and Remakers from the Perspective of Translatıon Studies
İstanbul Üniversitesi Çeviribilim Dergisi, 2023 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