Results 1  10
of
22
Combinatory Reduction Systems: introduction and survey
 THEORETICAL COMPUTER SCIENCE
, 1993
"... Combinatory Reduction Systems, or CRSs for short, were designed to combine the usual firstorder format of term rewriting with the presence of bound variables as in pure λcalculus and various typed calculi. Bound variables are also present in many other rewrite systems, such as systems with simpl ..."
Abstract

Cited by 88 (9 self)
 Add to MetaCart
Combinatory Reduction Systems, or CRSs for short, were designed to combine the usual firstorder format of term rewriting with the presence of bound variables as in pure λcalculus and various typed calculi. Bound variables are also present in many other rewrite systems, such as systems with simplification rules for proof normalization. The original idea of CRSs is due to Aczel, who introduced a restricted class of CRSs and, under the assumption of orthogonality, proved confluence. Orthogonality means that the rules are nonambiguous (no overlap leading to a critical pair) and leftlinear (no global comparison of terms necessary). We introduce the class of orthogonal CRSs, illustrated with many examples, discuss its expressive power, and give an outline of a short proof of confluence. This proof is a direct generalization of Aczel's original proof, which is close to the wellknown confluence proof for λcalculus by Tait and MartinLof. There is a wellknown connection between the para...
On Higher Order Recursive Program Schemes
 In: Proc. of the 19 th International Colloquium on Trees in Algebra and Programming, CAAP'94
"... . We define Higher Order Recursive Program Schemes (HRPSs) by allowing metasubstitutions (as in the calculus) in righthand sides of function and quantifier definitions. A study of several kinds of similarity of redexes makes it possible to lift properties of (first order) Recursive Program Schemes ..."
Abstract

Cited by 20 (16 self)
 Add to MetaCart
. We define Higher Order Recursive Program Schemes (HRPSs) by allowing metasubstitutions (as in the calculus) in righthand sides of function and quantifier definitions. A study of several kinds of similarity of redexes makes it possible to lift properties of (first order) Recursive Program Schemes to the higher order case. The main result is the decidability of weak normalization in HRPSs, which immediately implies that HRPSs do not have full computational power. We analyze the structural properties of HRPSs and introduce several kinds of persistent expression reduction systems (PERSs) that enjoy similar properties. Finally, we design an optimal evaluation procedure for PERSs. 1 Introduction Higher Order Recursive Program Schemes (HRPSs) are recursive definitions of functions, predicates, and quantifiers, considered as rewriting systems. Similar definitions are used when one extends a theory by introducing new symbols [16]. 9aA , (øa(A)=a)A and 9!aA , 9aA 8a8b(A (b=a)A ) a = b) a...
The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems
 In: Proc. of the 3 rd International Conference on Logical Foundations of Computer Science, LFCS'94, A. Nerode and Yu.V. Matiyasevich, eds., Springer LNCS
, 1994
"... We consider reductions in Orthogonal Expression Reduction Systems (OERS), that is, Orthogonal Term Rewriting Systems with bound variables and substitutions, as in the calculus. We design a strategy that for any given term t constructs a longest reduction starting from t if t is strongly normaliza ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
We consider reductions in Orthogonal Expression Reduction Systems (OERS), that is, Orthogonal Term Rewriting Systems with bound variables and substitutions, as in the calculus. We design a strategy that for any given term t constructs a longest reduction starting from t if t is strongly normalizable, and constructs an infinite reduction otherwise. The Conservation Theorem for OERSs follows easily from the properties of the strategy. We develop a method for computing the length of a longest reduction starting from a strongly normalizable term. We study properties of pure substitutions and several kinds of similarity of redexes. We apply these results to construct an algorithm for computing lengths of longest reductions in strongly persistent OERSs that does not require actual transformation of the input term. As a corollary, we have an algorithm for computing lengths of longest developments in OERSs. 1 Introduction A strategy is perpetual if, given a term t, it constructs an infinit...
Relative Normalization in Deterministic Residual Structures
 In: Proc. of the 19 th International Colloquium on Trees in Algebra and Programming, CAAP'96, Springer LNCS
, 1996
"... . This paper generalizes the Huet and L'evy theory of normalization by neededness to an abstract setting. We define Stable Deterministic Residual Structures (SDRS) and Deterministic Family Structures (DFS) by axiomatizing some properties of the residual relation and the family relation on redex ..."
Abstract

Cited by 17 (13 self)
 Add to MetaCart
. This paper generalizes the Huet and L'evy theory of normalization by neededness to an abstract setting. We define Stable Deterministic Residual Structures (SDRS) and Deterministic Family Structures (DFS) by axiomatizing some properties of the residual relation and the family relation on redexes in an Abstract Rewriting System. We present two proofs of the Relative Normalization Theorem, one for SDRSs for regular stable sets, and another for DFSs for all stable sets of desirable `normal forms'. We further prove the Relative Optimality Theorem for DFSs. We extend this result to deterministic Computation Structures which are deterministic Event Structures with an extra relation expressing selfessentiality. 1 Introduction A normalizable term, in a rewriting system, may have an infinite reduction, so it is important to have a normalizing strategy which enables one to construct reductions to normal form. It is well known that the leftmostoutermost strategy is normalizing in the calc...
Finite Family Developments
"... Associate to a rewrite system R having rules l → r, its labelled version R ω having rules l ◦ m+1 → r • , for any natural number m m ∈ ω. These rules roughly express that a lefthand side l carrying labels all larger than m can be replaced by its righthand side r carrying labels all smaller than o ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
Associate to a rewrite system R having rules l → r, its labelled version R ω having rules l ◦ m+1 → r • , for any natural number m m ∈ ω. These rules roughly express that a lefthand side l carrying labels all larger than m can be replaced by its righthand side r carrying labels all smaller than or equal to m. A rewrite system R enjoys finite family developments (FFD) if R ω is terminating. We show that the class of higher order pattern rewrite systems enjoys FFD, extending earlier results for the lambda calculus and first order term rewrite systems.
Contextsensitive Conditional Expression Reduction Systems
 In Proc. of the International Workshop on Graph Rewriting and Computation, SEGRAGRA'95
, 1995
"... We introduce Contextsensitive Conditional Expression Reduction Systems (CERS) by extending and generalizing the notion of conditional TRS to the higher order case. We justify our framework in two ways. First, we define orthogonality for CERSs and show that the usual results for orthogonal systems ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We introduce Contextsensitive Conditional Expression Reduction Systems (CERS) by extending and generalizing the notion of conditional TRS to the higher order case. We justify our framework in two ways. First, we define orthogonality for CERSs and show that the usual results for orthogonal systems (finiteness of developments, confluence, permutation equivalence) carry over immediately. This can be used e.g. to infer confluence from the subject reduction property in several typed calculi possibly enriched with patternmatching definitions. Second, we express several proof and transition systems as CERSs. In particular, we give encodings of Hilbertstyle proof systems, Gentzenstyle sequentcalculi, rewrite systems with rule priorities, and the ßcalculus into CERSs. This last encoding is an (important) example of real contextsensitive rewriting. 1 Introduction A term rewriting system is a pair consisting of an alphabet and a set of rewrite rules. The alphabet is used freely to gene...
Relative Normalization in Orthogonal Expression Reduction Systems
 In: Proc. of the 4 th International workshop on Conditional (and Typed) Term Rewriting Systems, CTRS'94, Springer LNCS
, 1994
"... . We study reductions in orthogonal (leftlinear and nonambiguous) Expression Reduction Systems, a formalism for Term Rewriting Systems with bound variables and substitutions. To generalise the normalization theory of Huet and L'evy, we introduce the notion of neededness with respect to a set ..."
Abstract

Cited by 11 (10 self)
 Add to MetaCart
. We study reductions in orthogonal (leftlinear and nonambiguous) Expression Reduction Systems, a formalism for Term Rewriting Systems with bound variables and substitutions. To generalise the normalization theory of Huet and L'evy, we introduce the notion of neededness with respect to a set of reductions \Pi or a set of terms S so that each existing notion of neededness can be given by specifying \Pi or S. We imposed natural conditions on S, called stability, that are sufficient and necessary for each term not in Snormal form (i.e., not in S) to have at least one Sneeded redex, and repeated contraction of Sneeded redexes in a term t to lead to an Snormal form of t whenever there is one. Our relative neededness notion is based on tracing (open) components, which are occurrences of contexts not containing any bound variable, rather than tracing redexes or subterms. 1 Introduction Since a normalizable term, in a rewriting system, may have an infinite reduction, it is important to...
Discrete Normalization and Standardization in Deterministic Residual Structures
 In ALP '96 [ALP96
, 1996
"... . We prove a version of the Standardization Theorem and the Discrete Normalization (DN) Theorem in stable Deterministic Residual Structures, which are Abstract Reduction Systems with axiomatized residual relation, and model orthogonal rewrite systems. The latter theorem gives a strategy for construc ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
. We prove a version of the Standardization Theorem and the Discrete Normalization (DN) Theorem in stable Deterministic Residual Structures, which are Abstract Reduction Systems with axiomatized residual relation, and model orthogonal rewrite systems. The latter theorem gives a strategy for construction of reductions L'evyequivalent (or permutationequivalent) to a given, finite or infinite, regular (or semilinear) reduction, based on the neededness concept of Huet and L'evy. This and other results of this paper add to the understanding of L'evyequivalence of reductions, and consequently, L'evy's reduction space. We demonstrate how elements of this space can be used to give denotational semantics to known functional languages in an abstract manner. 1 Introduction Long ago, Curry and Feys [CuFe58] proved that repeated contraction of leftmostoutermost redexes in any normalizable term eventually yields its normal form, even if the term possesses infinite reductions as well. The reaso...
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
 INFORMATION AND COMPUTATION
"... We present two characterizations of perpetual redexes, which are redexes whose contractions retain the possibility of infinite reductions. These characterizations generalize and strengthen existing criteria for the perpetuality of redexes in orthogonal Term Rewriting Systems and the calculus due ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We present two characterizations of perpetual redexes, which are redexes whose contractions retain the possibility of infinite reductions. These characterizations generalize and strengthen existing criteria for the perpetuality of redexes in orthogonal Term Rewriting Systems and the calculus due to Bergstra and Klop, and others. To unify our results with those in the literature, we introduce Contextsensitive Conditional Expression Reduction Systems (CCERSs) and prove confluence for orthogonal CCERSs. We then define a perpetual onestep reduction strategy which enables one to construct minimal (w.r.t. Levy's permutation ordering on reductions) infinite reductions in orthogonal CCERSs. We then prove (1) perpetuality (in a specific context) of a redex whose contraction does not erase potentially infinite arguments, which are possibly finite (i.e., strongly normalizable) arguments that may become infinite after a number of outside steps, and (2) perpetuality (in every con...
Minimal Relative Normalization in Orthogonal Expression Reduction Systems
 In Proc. of the 16 th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS'96, Springer LNCS
, 1996
"... . In previous papers, the authors studied normalization relative to desirable sets S of `partial results', where it is shown that such sets must be stable. For example, the sets of normal forms, headnormalforms, and weak headnormalforms in the calculus, are all stable. They showed that, f ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
. In previous papers, the authors studied normalization relative to desirable sets S of `partial results', where it is shown that such sets must be stable. For example, the sets of normal forms, headnormalforms, and weak headnormalforms in the calculus, are all stable. They showed that, for any stable S, Sneeded reductions are Snormalizing. This paper continues the investigation into the theory of relative normalization. In particular, we prove existence of minimal normalizing reductions for regular stable sets of results. All the above mentioned sets are regular. We give a sufficient and necessary criterion for a normalizing reduction (w.r.t. a regular stable S) to be minimal. Finally, we establish a relationship between relative minimal and optimal reductions, revealing a conflict between minimality and optimality: for regular stable sets of results, a term need not possess a reduction that is minimal and optimal at the same time. 1 Introduction The Normalization Theorem in ...