Jan Willem Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam, 1980. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Primitive and Partial Rewriting - Dershowitz (2000) (Correct)
....here, since orthogonal systems are confluent. Proof The reduction is DEF(f j ; n) GCR(TK [ K n j ) 27) where K n j contains the rule T K ( j; n; y) 0 (28) 2 6 Halting Problems The normalizability problem NORM is NORM(R; t) Delta = 9z: t Gamma R z (29) Theorem 4 ([11]) Normalizability of definitional rewriting is undecidable. 9 10 Proof DEF(f j ; n) NORM(F j ; f j (n) 30) 2 For the weak termination problem WN WN(R) Delta = 8t: 9v: t R v (31) the situation is the same: Theorem 5 Weak termination of definitional rewriting is undecidable. Proof ....
Jan Willem Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam, 1980.
A de Bruijn notation for higher-order rewriting - Bonelli, Kesner, Ríos (2000) (1 citation) (Correct)
....for calculus [13] but also on de Bruijn metaterms, which are the syntactical objects used to express any general higher order rewrite system formulated in a de Bruijn context. Many higher order rewrite systems (HORS) exist and work in the area is currently very active. Klop introduced in [15] the Combinatory Reduction Systems (CRS) an early reference for Khasidashvili s Expression Reduction Systems (ERS ) is [14] Nipkow introduces Higher Order Rewrite Systems (HRS) in [16] Wolfram defines Higher Order Term Rewrite Systems (see [23] van Oostrom and van Raamsdonk introduce ....
Jan Willem Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. CWI, Amsterdam, 1980. PhD Thesis.
Confluence of Extensional and Non-Extensional λ-calculi.. - Kesner (Correct)
....in this paper would also be useful to study confluence on open terms and preservation of strong normalization, the challenge being the definition of an appropriate scheme associated to those properties. The scheme proposed in this paper could also be combined with Combinatory Reduction Systems [Klo80, KvOvR93], generalizing in that way the formalisms in [Pag98, BR96] which are defined to just cover one particular explicit substitution calculus. Acknowledgments I would like to thank Pierre Lescanne and Gilles Dowek for interesting discussions, Roberto Di Cosmo and Pierre Louis Curien for useful ....
Jan Willem Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. CWI, Amsterdam, 1980. PhD Thesis.
The complete list of RTA open problems - Date April Summary Self-citation (Systems) (Correct)
No context found.
Jan Willem Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam, 1980.
REFERENCES 2 [OO93] Michio Oyamaguchi and Yoshikatsu Ohta. On.. - Trans Ieice Self-citation (Systems) (Correct)
....nite terms in logic programming. In International conference on cation with in cation without occur check [MR84] have unique normal forms This conjecture was originally proposed in [OO89] with an incomplete proof, as an extension of the result on strongly nonoverlapping systems [Klo80][Che81] Related results appear in [OO93] TO94] MO94] but the original conjecture is still open. This is related to Problem 58. This problem is also related with modularity of con uence of systems sharing constructors, see [Ohl94] Remark: The answer is yes if the system is also nonduplicating ....
Jan Willem Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam, 1980.
More Problems in Rewriting - Dershowitz, Jouannaud, Klop (1993) (25 citations) Self-citation (Klop) (Correct)
....holds, it would follow that simulating operation symbols of arity n greater than 2 by n Gamma 1 binary symbols in a straightforward way does not affect termination behavior. Problem 61 (T. Nipkow, M. Takahashi) For higher order rewrite formats as given by combinatory reduction systems [ Klop, 1980 ] and higher order rewrite systems [ Nipkow, 1991; Takahashi, 1993 ] confluence has been proved in the restricted case of orthogonal systems. Can confluence be extended to such systems when they are weakly orthogonal (all critical pairs are trivial) When critical pairs arise only at the root, ....
....Fernandez, 1993a; Barbanera and Fernandez, 1993b ] Of a more general nature, proposals have been made for quite general rewriting formats that include rewriting with bound variables as in typed calculi, yielding pleasant mixtures of pattern matching and variable binding. The suggestions in [ Klop, 1980; Nipkow, 1991; Takahashi, 1993 ] are quite close, which is encouraging, as it may hint at a canonical framework for higher order rewriting. AC termination Recent work on proving termination of associative commutative rewriting (the most prevalent extension of term rewriting) includes [ Kapur et ....
Jan Willem Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam, 1980.
A Taste of Rewrite Systems - Dershowitz (1993) (6 citations) (Correct)
No context found.
Jan Willem Klop. Combinatory Reduction Systems,volume 127 of Mathematical CentreTracts. MathematischCentrum, Amsterdam, 1980.
A Taste of Rewrite Systems - Dershowitz (1993) (6 citations) (Correct)
No context found.
Jan Willem Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam, 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC