Results 211 to 220 of about 37,049 (259)
Plagiarism - How to Use and Read it. [PDF]
J Orthop Case RepVatkar AJ, Kale S, Shyam A, Shinde S.
europepmc +1 more source
Non-trivial Fixed Point of a ψ d 4 Fermionic Theory, II: Anomalous Exponent and Scaling Operators. [PDF]
Commun Math PhysGiuliani A +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018
Symmetric monoidal categories have become ubiquitous as a formal environment for the analysis of compound systems in a compositional, resource-sensitive manner using the graphical syntax of string diagrams. Recently, reasoning with string diagrams has been implemented concretely via double-pushout (DPO) hypergraph rewriting.
Filippo Bonchi +4 more
openaire +3 more sources
Symmetric monoidal categories have become ubiquitous as a formal environment for the analysis of compound systems in a compositional, resource-sensitive manner using the graphical syntax of string diagrams. Recently, reasoning with string diagrams has been implemented concretely via double-pushout (DPO) hypergraph rewriting.
Filippo Bonchi +4 more
openaire +3 more sources
1994
So far, the works in this area have tried to define suitable properties of non-terminating relations in order to guarantee that the intended infinite term can be reached as the limit of w-converging derivations. The main advantage of these approaches is the generality of the framework with respect to the set of infinite definable terms: no a priori ...
INVERARDI, PAOLA +1 more
openaire +4 more sources
So far, the works in this area have tried to define suitable properties of non-terminating relations in order to guarantee that the intended infinite term can be reached as the limit of w-converging derivations. The main advantage of these approaches is the generality of the framework with respect to the set of infinite definable terms: no a priori ...
INVERARDI, PAOLA +1 more
openaire +4 more sources
Optimization of rewriting and complexity of rewriting
1990Term rewriting technique is one of basic deduction tools in algebraic and logic programming. Computing the normal forms of terms is the fundamental step. In this paper, we design several strategies for term rewriting systems. We divide non-ambiguous and left-linear term rewriting systems into three subclasses: variable-more, variable-equal, and ...
openaire +1 more source
Emergency Nurse, 2002
The RCN ENP network group has proposed a rewrite of its definition of 'emergency nurse practitioner'.
openaire +2 more sources
The RCN ENP network group has proposed a rewrite of its definition of 'emergency nurse practitioner'.
openaire +2 more sources
Rewrite orderings and termination of rewrite systems
1991Termination or halting is essential in the proof of properties of programs. In 1936, Turing proved its undecidability for the computation model he devised. In 1942, Newman [New42] noticed the importance of termination for the proof of confluence of what he called equivalence and what we would call today rewrite rules.
openaire +1 more source
Termination of context-sensitive rewriting by rewriting
1996Context-sensitive rewriting allows us to deal with certain context-replacing restrictions in performing reduction steps. This is useful in avoiding undesirable reductions. In this paper, we study termination of context-sensitive rewriting. We give some conditions under which it is possible to analyze the termination of the context-sensitive rewrite ...
openaire +1 more source
2006
In this paper we review some of the recently obtained results that form the basis of a new framework for considering grammars and machines.
Andrzej Ehrenfeucht +2 more
openaire +1 more source
In this paper we review some of the recently obtained results that form the basis of a new framework for considering grammars and machines.
Andrzej Ehrenfeucht +2 more
openaire +1 more source