Results 41 to 50 of about 623,637 (299)
Automated Amortised Resource Analysis for Term Rewrite Systems [PDF]
Fuji International Symposium on Functional and Logic Programming, 2018 Based on earlier work on amortised resource analysis, we establish a novel automated amortised resource analysis for term rewrite systems. The method is presented in an inference system akin to a type system and gives rise to polynomial bounds on the ...
G. Moser, Manuel Schneckenreither
semanticscholar +1 more source
Journal of Algebra, 2011 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
A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We present a term rewrite system that formally models the Message Authenticator Algorithm (MAA), which was one of the first cryptographic functions for computing a Message Authentication Code and was adopted, between 1987 and 2001, in international ...
Hubert Garavel, Lina Marsso
doaj +1 more source
Journal of the American Chemical Society, 2009 We describe microarraying of carbohydrates for protein screening using either disulfide bridge or Schiff base imine immobilization chemistries on plasmachemical deposited functional nanolayers. The commonly observed issue of nonspecific background binding of proteins is overcome by spotting carbohydrates through a protein-resistant overlayer yielding ...
Harris, L G +4 more
openaire +3 more sources
Natural Transformations as Rewrite Rules and Monad Composition [PDF]
Logical Methods in Computer Science, 2019 Eklund et al. (2002) present a graphical technique aimed at simplifying the verification of various category-theoretic constructions, notably the composition of monads. In this note we take a different approach involving string rewriting.
Dexter Kozen
doaj +1 more source
Term Graph Rewriting and Parallel Term Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 In Proceedings TERMGRAPH 2011, arXiv:1102 ...
CORRADINI, ANDREA, DREWES F.
openaire +4 more sources
Datatype defining rewrite systems for naturals and integers [PDF]
Logical Methods in Computer Science, 2021 A datatype defining rewrite system (DDRS) is an algebraic (equational) specification intended to specify a datatype. When interpreting the equations from left-to-right, a DDRS defines a term rewriting system that must be ground-complete.
Jan A. Bergstra, Alban Ponse
doaj +1 more source
Rewrite Closure and CF Hedge Automata [PDF]
, 2012 We introduce an extension of hedge automata called bidimensional context-free hedge automata. The class of unranked ordered tree languages they recognize is shown to be preserved by rewrite closure with inverse-monadic rules.
A. Bouajjani +6 more
core +6 more sources
REWRITING THE WOMEN OF BREWSTER PLACE: MALE VOICES / RÉÉCRITURE DU SÉRIAL THE WOMEN OF BREWSTER PLACE: LES VOIX MASCULINS / RESCRIEREA SERIALULUI FEMEILE DIN BREWSTER: VOCILE MASCULINE [PDF]
Studii si Cercetari Filologice: Seria Limbi Straine Aplicate, 2013 Gloria Naylor’s The Men of Brewster Place (1994) relates the saga of black men in the urban environment of the same name. Coming from different horizons, each with a different and individual story, these men arrive at Brewster Place hoping to cope with
Kouadio Germain N’Guessan
doaj
Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining [PDF]
Logical Methods in Computer Science, 2014 We investigate unification problems related to the Cipher Block Chaining (CBC) mode of encryption. We first model chaining in terms of a simple, convergent, rewrite system over a signature with two disjoint sorts: list and element.
Siva Anantharaman +3 more
doaj +1 more source