Results 61 to 70 of about 12,133 (300)
Descendants and Origins in Term Rewriting
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bethke, I., Klop, J.W., Vrijer, R. de
openaire +5 more sources
Natural Inductive Theorems for Higher-Order Rewriting [PDF]
The notion of inductive theorems is well-established in first-order term rewriting. In higher-order term rewriting, in contrast, it is not straightforward to extend this notion because of extensionality (Meinke, 1992).
Chiba, Yuki +2 more
core +1 more source
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
We discuss applications of rewriting in three different areas: design and analysis of algorithms, theorem proving and term rewriting, and modeling and analysis of biological ...
Ashish Tiwari, Tiwari, Ashish
core +1 more source
On Quasi Ordinal Diagram Systems [PDF]
The purposes of this note are the following two; we first generalize Okada-Takeuti's well quasi ordinal diagram theory, utilizing the recent result of Dershowitz-Tzameret's version of tree embedding theorem with gap conditions.
Mitsuhiro Okada, Yuta Takahashi
doaj +1 more source
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Towards a Theory of Tracing for Functional Programs based on Graph Rewriting [PDF]
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support program comprehension and debugging.
Luo, Yong +3 more
core
Interval Term Rewriting System: Toward A Formal Model for Interval Computation
We present a term rewriting system for interval arithmetic (addition, subtraction and multiplication), toward a mathematical model for interval compu- tation.
A.X. Carvalho, R.H.N. Santiago
doaj +1 more source
Termination of canonical context-sensitive rewriting and productivity of rewrite systems [PDF]
Termination of programs, i.e., the absence of infinite computations, ensures the existence of normal forms for all initial expressions, thus providing an essential ingredient for the definition of a normalization semantics for functional programs.
Salvador Lucas
doaj +1 more source
Phosphatidylinositol 4‐kinase as a target of pathogens—friend or foe?
This graphical summary illustrates the roles of phosphatidylinositol 4‐kinases (PI4Ks). PI4Ks regulate key cellular processes and can be hijacked by pathogens, such as viruses, bacteria and parasites, to support their intracellular replication. Their dual role as essential host enzymes and pathogen cofactors makes them promising drug targets.
Ana C. Mendes +3 more
wiley +1 more source

