Results 31 to 40 of about 31,656 (296)
Information and Computation, 2007 AbstractNominal rewriting is based on the observation that if we add support for α-equivalence to first-order syntax using the nominal-set approach, then systems with binding, including higher-order reduction schemes such as λ-calculus beta-reduction, can be smoothly represented. Nominal rewriting maintains a strict distinction between variables of the
Fernandez, M, Gabbay, M
openaire +3 more sources
On probabilistic term rewriting [PDF]
Science of Computer Programming, 2018 We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems are considered.
Akihisa Yamada +3 more
openaire +6 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
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
A Rewriting View of Simple Typing [PDF]
Logical Methods in Computer Science, 2013 This paper shows how a recently developed view of typing as small-step abstract reduction, due to Kuan, MacQueen, and Findler, can be used to recast the development of simple type theory from a rewriting perspective.
Aaron Stump +3 more
doaj +1 more source
Electronic Notes in Theoretical Computer Science, 2005 This is a position paper preparing the round table organized during the 4th International Workshop on Reduction Strategies in Rewriting and Programming. I sketch what I believe to be important challenges of strategic rewriting.
openaire +3 more sources
Transforming cycle rewriting into string rewriting
, 2015 RTA 2015 : 26th International Conference on Rewriting Techniques and Applications, June 29-July 1, 2015, Warsaw ...
Sabel, David, Zantema, Hans
openaire +6 more sources
Population Ecology, EarlyView.Population size and dynamics fundamentally shape speciation by influencing genetic drift, founder events, and adaptive potential. Small populations may speciate rapidly due to stronger drift, whereas large populations harbor more genetic diversity, which can alter divergence trajectories. We highlight theoretical models that incorporate population size
Ryo Yamaguchi +3 more
wiley +1 more source
FoxO1 signaling in B cell malignancies and its therapeutic targeting
FEBS Letters, EarlyView.FoxO1 has context‐specific tumor suppressor or oncogenic character in myeloid and B cell malignancies. This includes tumor‐promoting properties such as stemness maintenance and DNA damage tolerance in acute leukemias, or regulation of cell proliferation and survival, or migration in mature B cell malignancies.
Krystof Hlavac +3 more
wiley +1 more source
Theoretical Computer Science, 1984 This paper deals with rewriting of directed ordered graphs over a graded alphabet G. The author shows that if graphs are represented by vertices and edges direct derivations accordin to \textit{H. Ehrig}, \textit{M. Pfender}, and \textit{H. J. Schneider} [Graph Grammars: an algebraic approach, Proc. 14th Annual Conf. Switching Automata Theory, 167-180 (
openaire +2 more sources