Results 221 to 230 of about 15,524 (267)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maribel Fernández, Murdoch J Gabbay
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Rewriting the world, rewriting the body
1999Possibly the most heated critical controversy in English Renaissance studies has concerned the question of personal identity, the existence of the self. New Historicists and cultural materialists have maintained that the self is always a social construct, branding their opponents as naive essentialists. From a less parochial viewpoint, the argument may
openaire +1 more source
2003
In this paper we describe the implementation of the UNITY formalism as an extension of general-purpose languages and show its translation to C abstract syntax using PHOBOS, our generic front-end in the Mojave compiler. PHOBOS uses term rewriting to define the syntax and semantics of programming languages, and automates their translation to an internal ...
Granicz, Adam +2 more
openaire +2 more sources
In this paper we describe the implementation of the UNITY formalism as an extension of general-purpose languages and show its translation to C abstract syntax using PHOBOS, our generic front-end in the Mojave compiler. PHOBOS uses term rewriting to define the syntax and semantics of programming languages, and automates their translation to an internal ...
Granicz, Adam +2 more
openaire +2 more sources
JAMA, 1967
Most authors, particularly those with little experience, use too many words. And most factual writing gains clarity by being shortened. This shortening becomes a large part of the much neglected task of revision, a task which seems necessary to produce truly skillful, effective writing. Garland 1 has suggested—at least partly seriously —that "...
openaire +2 more sources
Most authors, particularly those with little experience, use too many words. And most factual writing gains clarity by being shortened. This shortening becomes a large part of the much neglected task of revision, a task which seems necessary to produce truly skillful, effective writing. Garland 1 has suggested—at least partly seriously —that "...
openaire +2 more sources

