22 papers:
WRLA-J-2010-DuranM12 #on the #order- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (FD, JM), pp. 816–850.
ICALP-v2-2012-DiekertKRW #regular expression- Regular Languages Are Church-Rosser Congruential (VD, MK, KR, TW), pp. 177–188.
CSL-2012-JouannaudL- Church-Rosser Properties of Normal Rewriting (JPJ, JL), pp. 350–365.
- WRLA-2010-DuranM #equation #maude #order #specification
- A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications (FD, JM), pp. 69–85.
FLOPS-2010-KetemaS #bound #diagrams #term rewriting #λ-calculus- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.
RTA-2006-Jouannaud #composition- Modular Church-Rosser Modulo (JPJ), pp. 96–107.
- ICALP-2002-JurdzinskiL
- Church-Rosser Languages vs. UCFL (TJ, KL), pp. 147–158.
DLT-2001-NiemannW01a #regular expression- Some Regular Languages That Are Church-Rosser Congruential (GN, JW), pp. 330–339.
- RTA-2001-Woinowski #normalisation
- A Normal Form for Church-Rosser Language Systems (JRW), pp. 322–337.
- DLT-1999-NiemannO #automaton
- Restarting automata, Church-Rosser languages, and representations of r.e. languages (GN, FO), pp. 103–114.
FoSSaCS-1998-NiemannO #context-sensitive grammar- The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages (GN, FO), pp. 243–257.
- RTA-1998-Ohlebusch #equivalence #reduction #theorem
- Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation (EO), pp. 17–31.
- RTA-1998-Okui
- Simultaneous Critical Pairs and Church-Rosser Property (SO), pp. 2–16.
CADE-1996-Nipkow #higher-order #proving- More Church-Rosser Proofs (in Isabelle/HOL) (TN), pp. 733–747.
LICS-1994-GeuversW #on the #type system- On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study (HG, BW), pp. 320–329.
- LICS-1992-Geuvers #λ-calculus
- The Church-Rosser Property for βη-reduction in Typed λ-Calculi (HG), pp. 453–460.
- ICALP-1990-Klop #term rewriting
- Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond (JWK), pp. 350–369.
- RTA-1985-Otto #algebra #finite #monad
- Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems (FO), pp. 95–106.
GG-1982-EhrigS #graph transformation- Church-Rosser properties for graph replacement systems with unique splitting (HE, JS), pp. 82–101.
- CADE-1982-Book #power of #string #term rewriting
- The Power of the Church-Rosser Property for String Rewriting Systems (RVB), pp. 360–368.
- ICALP-1974-Dezani-CiancagliniZ #algorithm #parallel #performance
- Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms (MDC, MZ), pp. 170–184.
STOC-1970-Rosen #theorem- Tree-Manipulating Systems and Church-Rosser Theorems (BKR), pp. 117–127.
