Dornemann, Jorin; Schrader, Rainer Cross-series-parallel digraphs. (English) Zbl 1477.05083 Discrete Appl. Math. 303, 57-65 (2021). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 68Q06 06A99 PDF BibTeX XML Cite \textit{J. Dornemann} and \textit{R. Schrader}, Discrete Appl. Math. 303, 57--65 (2021; Zbl 1477.05083) Full Text: DOI OpenURL
Meseguer, José Strict coherence of conditional rewriting modulo axioms. (English) Zbl 1386.68080 Theor. Comput. Sci. 672, 1-35 (2017). MSC: 68Q42 03B70 PDF BibTeX XML Cite \textit{J. Meseguer}, Theor. Comput. Sci. 672, 1--35 (2017; Zbl 1386.68080) Full Text: DOI OpenURL
Simonsen, Jakob Grue A confluent rewriting system having no computable, one-step, normalizing strategy. (English) Zbl 1354.68144 ACM Trans. Comput. Log. 16, No. 2, Article No. 10, 9 p. (2015). MSC: 68Q42 03B40 PDF BibTeX XML Cite \textit{J. G. Simonsen}, ACM Trans. Comput. Log. 16, No. 2, Article No. 10, 9 p. (2015; Zbl 1354.68144) Full Text: DOI OpenURL
Kanovich, Max Multiset rewriting over Fibonacci and tribonacci numbers. (English) Zbl 1327.68143 J. Comput. Syst. Sci. 80, No. 6, 1138-1151 (2014). MSC: 68Q42 05A17 11B39 PDF BibTeX XML Cite \textit{M. Kanovich}, J. Comput. Syst. Sci. 80, No. 6, 1138--1151 (2014; Zbl 1327.68143) Full Text: DOI OpenURL
Ketema, Jeroen; Simonsen, Jakob Grue Least upper bounds on the size of confluence and Church-Rosser diagrams in term rewriting and \(\lambda\)-calculus. (English) Zbl 1354.68143 ACM Trans. Comput. Log. 14, No. 4, Article No. 31, 28 p. (2013). MSC: 68Q42 03B40 03D20 PDF BibTeX XML Cite \textit{J. Ketema} and \textit{J. G. Simonsen}, ACM Trans. Comput. Log. 14, No. 4, Article No. 31, 28 p. (2013; Zbl 1354.68143) Full Text: DOI OpenURL
Kamareddine, Fairouz; Rahli, Vincent; Wells, J. B. Reducibility proofs in the \(\lambda \)-calculus. (English) Zbl 1277.03012 Fundam. Inform. 121, No. 1-4, 121-152 (2012). Reviewer: Martin W. Bunder (Wollongong) MSC: 03B40 PDF BibTeX XML Cite \textit{F. Kamareddine} et al., Fundam. Inform. 121, No. 1--4, 121--152 (2012; Zbl 1277.03012) Full Text: DOI OpenURL
Durán, Francisco; Meseguer, José On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories. (English) Zbl 1272.03139 J. Log. Algebr. Program. 81, No. 7-8, 816-850 (2012). MSC: 03B70 68N18 68N19 68Q42 68Q60 PDF BibTeX XML Cite \textit{F. Durán} and \textit{J. Meseguer}, J. Log. Algebr. Program. 81, No. 7--8, 816--850 (2012; Zbl 1272.03139) Full Text: DOI OpenURL
Jouannaud, Jean-Pierre; Li, Jianqi Church-Rosser properties of normal rewriting. (English) Zbl 1252.68159 Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3–6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPIcs – Leibniz International Proceedings in Informatics 16, 350-365, electronic only (2012). MSC: 68Q42 PDF BibTeX XML Cite \textit{J.-P. Jouannaud} and \textit{J. Li}, LIPIcs -- Leibniz Int. Proc. Inform. 16, 350--365 (2012; Zbl 1252.68159) Full Text: DOI OpenURL
Baldan, Paolo; Gadducci, Fabio; Sobociński, Pawel Adhesivity is not enough: local Church-Rosser revisited. (English) Zbl 1343.68126 Murlak, Filip (ed.) et al., Mathematical foundations of computer science 2011. 36th international symposium, MFCS 2011, Warsaw, Poland, August 22–26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22992-3/pbk). Lecture Notes in Computer Science 6907, 48-59 (2011). MSC: 68Q42 PDF BibTeX XML Cite \textit{P. Baldan} et al., Lect. Notes Comput. Sci. 6907, 48--59 (2011; Zbl 1343.68126) Full Text: DOI Link OpenURL
Kamareddine, Fairouz; Rahli, Vincent Simplified reducibility proofs of Church-Rosser for \({\beta}\)- and \({\beta}{\eta}\)-reduction. (English) Zbl 1311.03030 Horizonte, Belo (ed.) et al., Proceedings of the 3rd workshop on logical and semantic frameworks, with applications (LSFA 2008), Salvador, Brazil, August 26, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 247, 85-101 (2009). MSC: 03B40 PDF BibTeX XML Cite \textit{F. Kamareddine} and \textit{V. Rahli}, Electron. Notes Theor. Comput. Sci. 247, 85--101 (2009; Zbl 1311.03030) Full Text: DOI OpenURL
Lévy, Jean-Jacques Generalized finite developments. (English) Zbl 1195.68028 Bertot, Yves (ed.) et al., From semantics to computer science. Essays in honour of Gilles Kahn. Cambridge: Cambridge University Press (ISBN 978-0-521-51825-3/hbk). 185-203 (2009). MSC: 68N18 03B40 PDF BibTeX XML Cite \textit{J.-J. Lévy}, in: From semantics to computer science. Essays in honour of Gilles Kahn. Cambridge: Cambridge University Press. 185--203 (2009; Zbl 1195.68028) OpenURL
Koletsos, George; Stavrinos, George Church-Rosser property and intersection types. (English) Zbl 1166.03005 Australas. J. Log. 6, 37-54 (2008). MSC: 03B40 PDF BibTeX XML Cite \textit{G. Koletsos} and \textit{G. Stavrinos}, Australas. J. Log. 6, 37--54 (2008; Zbl 1166.03005) OpenURL
Kanovich, Max A note on rewriting proofs and Fibonacci numbers. (English) Zbl 1133.05006 Artemov, Sergei N. (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72732-3/pbk). Lecture Notes in Computer Science 4514, 284-292 (2007). MSC: 05A17 05A20 68Q42 68T15 PDF BibTeX XML Cite \textit{M. Kanovich}, Lect. Notes Comput. Sci. 4514, 284--292 (2007; Zbl 1133.05006) Full Text: DOI OpenURL
Nour, Karim; Saber, Khelifa Confluency property of the call-by-value \(\lambda\mu^{\wedge\vee}\)-calculus. (English) Zbl 1193.03032 David, René (ed.) et al., Computational logic and applications, CLA ’05. Proceedings of the 3rd workshop, Chambéry, France, June 20–21, 2005. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings AF, 97-108, electronic only (2006). MSC: 03B40 03B05 68N18 PDF BibTeX XML Cite \textit{K. Nour} and \textit{K. Saber}, in: Computational logic and applications, CLA '05. Proceedings of the 3rd workshop, Chambéry, France, June 20--21, 2005. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 97--108 (2006; Zbl 1193.03032) Full Text: arXiv Link OpenURL
Simonsen, Jakob Grue On modularity in infinitary term rewriting. (English) Zbl 1104.68057 Inf. Comput. 204, No. 6, 957-988 (2006). MSC: 68Q42 PDF BibTeX XML Cite \textit{J. G. Simonsen}, Inf. Comput. 204, No. 6, 957--988 (2006; Zbl 1104.68057) Full Text: DOI OpenURL
Stamer, Heiko Completion attacks and weak keys of Oleshchuk’s public key cryptosystem. (English) Zbl 1153.94431 Maitra, Subhamoy (ed.) et al., Progress in cryptology – INDOCRYPT 2005. 6th international conference on cryptology in India, Bangalore, India, December 10–12, 2005, Proceedings. Berlin: Springer (ISBN 978-3-540-30805-8/pbk). Lecture Notes in Computer Science 3797, 209-220 (2005). MSC: 94A60 PDF BibTeX XML Cite \textit{H. Stamer}, Lect. Notes Comput. Sci. 3797, 209--220 (2005; Zbl 1153.94431) Full Text: DOI OpenURL
Bimbó, Katalin The Church-Rosser property in symmetric combinatory logic. (English) Zbl 1090.03003 J. Symb. Log. 70, No. 2, 536-556 (2005). Reviewer: Martin W. Bunder (Wollongong) MSC: 03B40 03B47 PDF BibTeX XML Cite \textit{K. Bimbó}, J. Symb. Log. 70, No. 2, 536--556 (2005; Zbl 1090.03003) Full Text: DOI OpenURL
Simonsen, Jakob Grue On confluence and residuals in Cauchy convergent transfinite rewriting. (English) Zbl 1178.68304 Inf. Process. Lett. 91, No. 3, 141-146 (2004). MSC: 68Q42 PDF BibTeX XML Cite \textit{J. G. Simonsen}, Inf. Process. Lett. 91, No. 3, 141--146 (2004; Zbl 1178.68304) Full Text: DOI OpenURL
Sánchez Alvarez, Daniel; Gómez Skarmeta, Antonio F. A fuzzy language. (English) Zbl 1059.68017 Fuzzy Sets Syst. 141, No. 3, 335-390 (2004). MSC: 68N15 68N18 PDF BibTeX XML Cite \textit{D. Sánchez Alvarez} and \textit{A. F. Gómez Skarmeta}, Fuzzy Sets Syst. 141, No. 3, 335--390 (2004; Zbl 1059.68017) Full Text: DOI OpenURL
Bimbó, Katalin The Church-Rosser property in dual combinatory logic. (English) Zbl 1045.03017 J. Symb. Log. 68, No. 1, 132-152 (2003). Reviewer: Martin W. Bunder (Wollongong) MSC: 03B40 PDF BibTeX XML Cite \textit{K. Bimbó}, J. Symb. Log. 68, No. 1, 132--152 (2003; Zbl 1045.03017) Full Text: DOI OpenURL
Fujita, Ken-etsu An injective CPS-translation for the extensional \(\lambda\)-calculus. (English) Zbl 1060.68020 Mem. Fac. Sci. Eng., Shimane Univ., Ser. B, Math. Sci. 36, 39-48 (2003). MSC: 68N18 68Q05 68Q55 03B40 PDF BibTeX XML Cite \textit{K.-e. Fujita}, Mem. Fac. Sci. Eng., Shimane Univ., Ser. B, Math. Sci. 36, 39--48 (2003; Zbl 1060.68020) OpenURL
Beaudry, M.; Holzer, M.; Niemann, G.; Otto, F. McNaughton families of languages. (English) Zbl 1044.68082 Theor. Comput. Sci. 290, No. 3, 1581-1628 (2003). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Beaudry} et al., Theor. Comput. Sci. 290, No. 3, 1581--1628 (2003; Zbl 1044.68082) Full Text: DOI OpenURL
Tortora de Falco, Lorenzo Additives of linear logic and normalization. I: A (restricted) Church-Rosser property. (English) Zbl 1039.03047 Theor. Comput. Sci. 294, No. 3, 489-524 (2003). MSC: 03F52 03F05 PDF BibTeX XML Cite \textit{L. Tortora de Falco}, Theor. Comput. Sci. 294, No. 3, 489--524 (2003; Zbl 1039.03047) Full Text: DOI OpenURL
Andou, Y. Church-Rosser property of a simple reduction for full first-order classical natural deduction. (English) Zbl 1016.03006 Ann. Pure Appl. Logic 119, No. 1-3, 225-237 (2003). MSC: 03B10 03B40 03F05 PDF BibTeX XML Cite \textit{Y. Andou}, Ann. Pure Appl. Logic 119, No. 1--3, 225--237 (2003; Zbl 1016.03006) Full Text: DOI OpenURL
Kanovich, Max Bijections between partitions by two-directional rewriting techniques. (English) Zbl 1020.68042 Bradfield, Julian (ed.), Computer science logic. 16th international workshop, CSL 2002, 11th annual conference of the EACSL, Edinburgh, Scotland, GB, September 22-25, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2471, 44-58 (2002). MSC: 68Q42 05A18 05A19 PDF BibTeX XML Cite \textit{M. Kanovich}, Lect. Notes Comput. Sci. 2471, 44--58 (2002; Zbl 1020.68042) Full Text: Link OpenURL
Beckmann, Arnold Proving consistency of equational theories in bounded arithmetic. (English) Zbl 1011.03043 J. Symb. Log. 67, No. 1, 279-296 (2002). Reviewer: Roman Kossak (New York) MSC: 03F30 PDF BibTeX XML Cite \textit{A. Beckmann}, J. Symb. Log. 67, No. 1, 279--296 (2002; Zbl 1011.03043) Full Text: DOI OpenURL
Ayala-Rincón, Mauricio Church-Rosser property for conditional rewriting systems with built-in predicates as premises. (English) Zbl 1004.68079 Gabbay, Dov M. (ed.) et al., Frontiers of combining systems 2. Selected papers from the 2nd international workshop (FroCoS’98), Amsterdam, Netherlands, October 2-4, 1998. Baldock: Research Studies Press. Stud. Log. Comput. 7, 17-37 (2000). MSC: 68Q42 PDF BibTeX XML Cite \textit{M. Ayala-Rincón}, Stud. Log. Comput. 7, 17--37 (2000; Zbl 1004.68079) OpenURL
Bimbó, Katalin Investigation into combinatory systems with dual combinators. (English) Zbl 0963.03021 Stud. Log. 66, No. 2, 285-296 (2000). MSC: 03B40 03B47 PDF BibTeX XML Cite \textit{K. Bimbó}, Stud. Log. 66, No. 2, 285--296 (2000; Zbl 0963.03021) Full Text: DOI OpenURL
Minari, Pierluigi Theories of types and names with positive stratified comprehension. (English) Zbl 0922.03081 Stud. Log. 62, No. 2, 215-242 (1999). MSC: 03F50 03B40 PDF BibTeX XML Cite \textit{P. Minari}, Stud. Log. 62, No. 2, 215--242 (1999; Zbl 0922.03081) Full Text: DOI OpenURL
McNaughton, Robert Contributions of Ronald V. Book to the theory of string-rewriting systems. (English) Zbl 0913.68111 Theor. Comput. Sci. 207, No. 1, 13-23 (1998). MSC: 68Q42 PDF BibTeX XML Cite \textit{R. McNaughton}, Theor. Comput. Sci. 207, No. 1, 13--23 (1998; Zbl 0913.68111) Full Text: DOI OpenURL
Fujita, Ken-etsu Polymorphic call-by-value calculus based on classical proofs (extended abstract). (English) Zbl 0914.03036 Calmet, Jacques (ed.) et al., Artificial intelligence and symbolic computation. International conference AISC ’98, Plattsburgh, NY, USA, September 16–18, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1476, 170-182 (1998). MSC: 03B70 PDF BibTeX XML Cite \textit{K.-e. Fujita}, Lect. Notes Comput. Sci. 1476, 170--182 (1998; Zbl 0914.03036) OpenURL
Fujita, Ken-etsu Calculus of classical proofs. I. (English) Zbl 0890.03028 Shyamasundar, R. K. (ed.) et al., Advances in computing science - ASIAN ’97. 3rd Asian computing science conference, Kathmandu, Nepal, December 9–11, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1345, 321-335 (1997). MSC: 03F03 03B05 03B70 PDF BibTeX XML Cite \textit{K.-e. Fujita}, Lect. Notes Comput. Sci. 1345, 321--335 (1997; Zbl 0890.03028) OpenURL
Danos, Vincent; Joinet, Jean-Baptiste; Schellinx, Harold A new deconstructive logic: Linear logic. (English) Zbl 0895.03023 J. Symb. Log. 62, No. 3, 755-807 (1997). Reviewer: G.Mints (Stanford) MSC: 03F05 PDF BibTeX XML Cite \textit{V. Danos} et al., J. Symb. Log. 62, No. 3, 755--807 (1997; Zbl 0895.03023) Full Text: DOI OpenURL
Berarducci, Alessandro; Intrigila, Benedetto Church-Rosser \(\lambda\)-theories, infinite \(\lambda\)-terms and consistency problems. (English) Zbl 0867.03004 Hodges, Wilfrid (ed.) et al., Logic: from foundations to applications. European logic colloquium, Keele, UK, July 20–29, 1993. Oxford: Clarendon Press. 33-58 (1996). Reviewer: M.W.Bunder (Wollongong) MSC: 03B40 PDF BibTeX XML Cite \textit{A. Berarducci} and \textit{B. Intrigila}, in: Logic: from foundations to applications. European logic colloquium, Keele, UK, July 20--29, 1993. Oxford: Clarendon Press. 33--58 (1996; Zbl 0867.03004) OpenURL
Révész, György Categorical combinators with explicit products. (English) Zbl 0856.03015 Publ. Math. Debr. 48, No. 3-4, Suppl., 389-403 (1996). Reviewer: Hirokazu Nishimura (Tsukuba) MSC: 03B40 18D15 03G30 PDF BibTeX XML Cite \textit{G. Révész}, Publ. Math. Debr. 48, No. 3--4, 389--403 (1996; Zbl 0856.03015) OpenURL
Crossley, John N.; Mandel, Luis; Wirsing, Martin First-order constrained lambda calculus. (English) Zbl 0893.03002 Baader, Franz (ed.) et al., Frontiers of combining systems. First international workshop, Munich, Germany, March 26–29, 1996. Dordrecht: Kluwer Academic Publishers. Appl. Log. Ser. 3, 339-356 (1996). MSC: 03B40 03B70 68Q55 68N01 PDF BibTeX XML Cite \textit{J. N. Crossley} et al., Appl. Log. Ser. 3, 339--356 (1996; Zbl 0893.03002) OpenURL
Kamareddine, Fairouz; Nederpelt, Rob Refining reduction in the lambda calculus. (English) Zbl 0846.68057 J. Funct. Program. 5, No. 4, 637-651 (1995). MSC: 68Q45 PDF BibTeX XML Cite \textit{F. Kamareddine} and \textit{R. Nederpelt}, J. Funct. Program. 5, No. 4, 637--651 (1995; Zbl 0846.68057) Full Text: DOI OpenURL
Kennaway, Richard; Klop, Jan Willem; Sleep, Ronan; de Vries, Fer-Jan Transfinite reductions in orthogonal term rewriting systems. (English) Zbl 0832.68063 Inf. Comput. 119, No. 1, 18-38 (1995). MSC: 68Q42 PDF BibTeX XML Cite \textit{R. Kennaway} et al., Inf. Comput. 119, No. 1, 18--38 (1995; Zbl 0832.68063) Full Text: DOI Link OpenURL
Curien, Pierre-Louis; Hardin, Thérèse Theoretical pearl: Yet yet a counterexample for \(\lambda + SP\). (English) Zbl 0821.03006 J. Funct. Program. 4, No. 1, 113-115 (1994). Reviewer: M.W.Bunder (Wollongong) MSC: 03B40 PDF BibTeX XML Cite \textit{P.-L. Curien} and \textit{T. Hardin}, J. Funct. Program. 4, No. 1, 113--115 (1994; Zbl 0821.03006) Full Text: DOI OpenURL
Pentus, Mati The conjoinability relation in Lambek calculus and linear logic. (English) Zbl 0805.03004 J. Logic Lang. Inf. 3, No. 2, 121-140 (1994). MSC: 03B15 03B20 PDF BibTeX XML Cite \textit{M. Pentus}, J. Logic Lang. Inf. 3, No. 2, 121--140 (1994; Zbl 0805.03004) Full Text: DOI OpenURL
Poirriez, V. MLOG: A strongly typed confluent functional language with logical variables. (English) Zbl 0801.68016 Theor. Comput. Sci. 122, No. 1-2, 201-223 (1994). MSC: 68N15 03B40 PDF BibTeX XML Cite \textit{V. Poirriez}, Theor. Comput. Sci. 122, No. 1--2, 201--223 (1994; Zbl 0801.68016) Full Text: DOI OpenURL
Book, Ronald V.; Otto, Friedrich String-rewriting systems. (English) Zbl 0832.68061 Texts and Monographs in Computer Science. New York, NY: Springer-Verlag. viii, 189 p. (1993). Reviewer: A.Widiger (Rostock) MSC: 68Q42 68-01 PDF BibTeX XML Cite \textit{R. V. Book} and \textit{F. Otto}, String-rewriting systems. New York, NY: Springer-Verlag (1993; Zbl 0832.68061) OpenURL
de Groote, Philippe Defining \(\lambda\)-typed \(\lambda\)-calculi by axiomatizing the typing relation. (English) Zbl 0797.68144 Enjalbert, Patrice (ed.) et al., STACS 93. 10th annual symposium on theoretical aspects of computer science, Würzburg, Germany, February 25-27, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 665, 712-723 (1993). MSC: 68T15 03B40 68Q45 PDF BibTeX XML Cite \textit{P. de Groote}, Lect. Notes Comput. Sci. 665, 712--723 (1993; Zbl 0797.68144) OpenURL
Fredholm, Daniel; Serafimovski, Svetozar Partial inductive definitions as type-systems for \(\lambda\)-terms. (English) Zbl 0786.03011 BIT 32, No. 1, 30-44 (1992). MSC: 03B40 PDF BibTeX XML Cite \textit{D. Fredholm} and \textit{S. Serafimovski}, BIT 32, No. 1, 30--44 (1992; Zbl 0786.03011) Full Text: DOI OpenURL
Jiang, Ying Scott’s semantics of lambda calculus is incompatible with the existence of a universal retraction. (La sémantique continue du lambda calcul est incompatible avec l’existence d’une rétraction universelle.) (French. English summary) Zbl 0756.03009 C. R. Acad. Sci., Paris, Sér. I 314, No. 10, 779-782 (1992). MSC: 03B40 68Q55 PDF BibTeX XML Cite \textit{Y. Jiang}, C. R. Acad. Sci., Paris, Sér. I 314, No. 10, 779--782 (1992; Zbl 0756.03009) OpenURL
Waldmann, Uwe Semantics of order-sorted specifications. (English) Zbl 0746.68064 Theor. Comput. Sci. 94, No. 1, 1-35 (1992). MSC: 68Q65 68Q55 68Q42 68W30 PDF BibTeX XML Cite \textit{U. Waldmann}, Theor. Comput. Sci. 94, No. 1, 1--35 (1992; Zbl 0746.68064) Full Text: DOI OpenURL
Révész, György E. A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem. (English) Zbl 0753.03009 Theor. Comput. Sci. 93, No. 1, 75-89 (1992). Reviewer: René David (Chambéry) MSC: 03B40 68N15 PDF BibTeX XML Cite \textit{G. E. Révész}, Theor. Comput. Sci. 93, No. 1, 75--89 (1992; Zbl 0753.03009) Full Text: DOI OpenURL
Fülöp, Zoltán; Vágvölgyi, Sándor Ground term rewriting rules for the word problem of ground term equations. (English) Zbl 0757.68069 Bull. EATCS 45, 186-201 (1991). MSC: 68Q42 68Q05 68T15 PDF BibTeX XML Cite \textit{Z. Fülöp} and \textit{S. Vágvölgyi}, Bull. EATCS 45, 186--201 (1991; Zbl 0757.68069) OpenURL
Koletsos, George Polymorphic lambda calculus: The Church-Rosser property. (English) Zbl 0724.03013 Theor. Comput. Sci. 79, No. 2, 365-371 (1991). Reviewer: T.Hikita (Kawasaki) MSC: 03B40 PDF BibTeX XML Cite \textit{G. Koletsos}, Theor. Comput. Sci. 79, No. 2, 365--371 (1991; Zbl 0724.03013) Full Text: DOI OpenURL
Luckhardt, H. Complexity versus the Church-Rosser property and confluence. (English) Zbl 0701.03016 Z. Math. Logik Grundlagen Math. 37, No. 1, 85-92 (1991). Reviewer: H.Luckhardt MSC: 03D15 03F20 PDF BibTeX XML Cite \textit{H. Luckhardt}, Z. Math. Logik Grundlagen Math. 37, No. 1, 85--92 (1991; Zbl 0701.03016) Full Text: DOI OpenURL
Toyama, Yoshihito How to prove equivalence of term rewriting systems without induction. (English) Zbl 0746.68049 Theor. Comput. Sci. 90, No. 2, 369-390 (1991). MSC: 68Q42 PDF BibTeX XML Cite \textit{Y. Toyama}, Theor. Comput. Sci. 90, No. 2, 369--390 (1991; Zbl 0746.68049) OpenURL
Jouannaud, Jean-Pierre Executable higher-order algebraic specifications. (English) Zbl 0764.68098 Theoretical aspects of computer science, Proc. 8th Annu. Symp., STACS ’91, Hamburg/Ger. 1991, Lect. Notes Comput. Sci. 480, 16-25 (1991). MSC: 68Q65 PDF BibTeX XML Cite \textit{J.-P. Jouannaud}, Lect. Notes Comput. Sci. 480, 16--25 (1991; Zbl 0764.68098) OpenURL
Kuzichev, Andrei A. Church-Rosser property for some extensions of \(\lambda{}\beta\)- reducibility relation. (English) Zbl 0759.03010 Z. Math. Logik Grundlagen Math. 37, No. 6, 547-559 (1991). Reviewer: A.A.Kuzichev MSC: 03B40 03H15 PDF BibTeX XML Cite \textit{A. A. Kuzichev}, Z. Math. Logik Grundlagen Math. 37, No. 6, 547--559 (1991; Zbl 0759.03010) Full Text: DOI OpenURL
Khasidashvili, Z. O. Expression reduction systems. (English) Zbl 0731.03011 Tr. Inst. Prikl. Mat. Im. I. N. Vekua 36, 200-220 (1990). MSC: 03B40 68Q42 03B30 PDF BibTeX XML Cite \textit{Z. O. Khasidashvili}, Tr. Inst. Prikl. Mat. Im. I. N. Vekua 36, 200--220 (1990; Zbl 0731.03011) OpenURL
López-Escobar, E. G. K. Remarks on the Church-Rosser property. (English) Zbl 0715.03025 J. Symb. Log. 55, No. 1, 106-112 (1990). Reviewer: A.A.Mullin MSC: 03F50 03B40 03F05 PDF BibTeX XML Cite \textit{E. G. K. López-Escobar}, J. Symb. Log. 55, No. 1, 106--112 (1990; Zbl 0715.03025) Full Text: DOI OpenURL
Kapur, Deepak; Narendran, Paliath; Otto, Friedrich On ground-confluence of term rewriting systems. (English) Zbl 0699.68041 Inf. Comput. 86, No. 1, 14-31 (1990). MSC: 68Q65 68W30 03D03 03B25 03D35 PDF BibTeX XML Cite \textit{D. Kapur} et al., Inf. Comput. 86, No. 1, 14--31 (1990; Zbl 0699.68041) Full Text: DOI OpenURL
Yokouchi, Hirofumi; Hikita, Teruo A rewriting system for categorical combinators with multiple arguments. (English) Zbl 0696.68041 SIAM J. Comput. 19, No. 1, 78-97 (1990). MSC: 68Q65 03B40 03D03 PDF BibTeX XML Cite \textit{H. Yokouchi} and \textit{T. Hikita}, SIAM J. Comput. 19, No. 1, 78--97 (1990; Zbl 0696.68041) Full Text: DOI Link OpenURL
Speckenmeyer, Ewald On feedback problems in digraphs. (English) Zbl 0768.68181 Graph-theoretic concepts in computer science, Proc. 15th Int. Workshop, WG ’89, Castle Rolduc/Neth. 1989, Lect. Notes Comput. Sci. 411, 218-231 (1990). MSC: 68R10 68Q25 05C20 60G50 PDF BibTeX XML Cite \textit{E. Speckenmeyer}, Lect. Notes Comput. Sci. 411, 218--231 (1990; Zbl 0768.68181) OpenURL
Richter, Michael M. Prinzipien der künstlichen Intelligenz. Wissensrepräsentation, Inferenz und Expertensysteme. (Principles of artificial intelligence. Knowledge representation, inference and expert systems.). (German) Zbl 0727.68119 Leitfäden und Monographien der Informatik. Stuttgart: B. G. Teubner Verlag. 355 p. DM 46.00 (1989). Reviewer: R.S.Lubarsky (Lancaster) MSC: 68T30 68-01 68T35 PDF BibTeX XML Cite \textit{M. M. Richter}, Prinzipien der künstlichen Intelligenz. Wissensrepräsentation, Inferenz und Expertensysteme. (Principles of artificial intelligence. Knowledge representation, inference and expert systems.). Stuttgart: B. G. Teubner Verlag (1989; Zbl 0727.68119) OpenURL
Breazu-Tannen, Val; Gallier, Jean Polymorphic rewriting conserves algebraic strong normalization and confluence. (English) Zbl 0686.68022 Automata, languages and programming, Proc. 16th Int. Colloq., Stresa/Italy 1989, Lect. Notes Comput. Sci. 372, 137-150 (1989). MSC: 68W30 68Q65 68P05 03D03 03B40 08A99 PDF BibTeX XML OpenURL
Sénizergues, G. Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages. (English) Zbl 0672.68040 Inf. Comput. 81, No. 3, 265-279 (1989). Reviewer: M.Jantzen MSC: 68Q45 68Q65 PDF BibTeX XML Cite \textit{G. Sénizergues}, Inf. Comput. 81, No. 3, 265--279 (1989; Zbl 0672.68040) Full Text: DOI OpenURL
Schmidt, Gunther; Ströhlein, Thomas Relationen und Graphen. (Relations and graphs). (German) Zbl 0705.68083 Mathematik für Informatiker. Berlin etc.: Springer-Verlag. VIII, 306 p. (1989). Reviewer: J.Ebert MSC: 68R10 05C90 05C85 68-01 68R99 03E20 PDF BibTeX XML Cite \textit{G. Schmidt} and \textit{T. Ströhlein}, Relationen und Graphen. (Relations and graphs). Berlin etc.: Springer-Verlag (1989; Zbl 0705.68083) OpenURL
Okada, Mitsuhiro A logical analysis on theory of conditional rewriting. (English) Zbl 0667.68106 Conditional term rewriting systems, 1st. int. Workshop, Orsay/France 1987, Lect. Notes Comput.Sci. 308, 179-196 (1988). Reviewer: T.Tammet MSC: 68T15 03B35 PDF BibTeX XML OpenURL
Ida, Tetsuo; Aiba, Akira; Toyama, Yoshihito T: A simple reduction language based on combinatory term rewriting. (English) Zbl 0659.68013 Programming of future generation computers, Proc. 1st Fr.-Jap. Symp., Tokyo/Jap. 1986, 217-236 (1988). Reviewer: H.Luchian MSC: 68N01 68T99 PDF BibTeX XML OpenURL
Kapur, Deepak; Musser, David R.; Narendran, Paliath Only prime superpositions need be considered in the Knuth-Bendix completion procedure. (English) Zbl 0651.68029 J. Symb. Comput. 6, No. 1, 19-36 (1988). MSC: 68Q65 68W30 68T15 PDF BibTeX XML Cite \textit{D. Kapur} et al., J. Symb. Comput. 6, No. 1, 19--36 (1988; Zbl 0651.68029) Full Text: DOI OpenURL
Brandenburg, Franz J. On polynomial time graph grammars. (English) Zbl 0644.68097 STACS 88, Theoretical aspects of computer science, Proc. 5th Annu. Symp., Bordeaux/France 1988, Lect. Notes Comput. Sci. 294, 227-236 (1988). MSC: 68Q45 68R10 68Q25 PDF BibTeX XML OpenURL
Padawitz, Peter Computing in Horn clause theories. (English) Zbl 0646.68004 EATCS Monographs on Theoretical Computer Science, 16. Berlin etc.: Springer-Verlag. XI, 322 p. DM 78.00 (1988). Reviewer: H.Nishimura MSC: 68-02 03B10 68Q65 68Q60 PDF BibTeX XML Cite \textit{P. Padawitz}, Computing in Horn clause theories. Berlin etc.: Springer-Verlag (1988; Zbl 0646.68004) OpenURL
Anisimov, A. V.; Oleshchuk, V. A. Church-Rosser systems with respect to formal languages. (English. Russian original) Zbl 0651.68101 Cybernetics 23, No. 5, 590-599 (1987); translation from Kibernetika 1987, No. 5, 19-25 (1987). Reviewer: J.Hromkovič MSC: 68Q45 08A50 03D35 20M05 03D03 03D40 PDF BibTeX XML Cite \textit{A. V. Anisimov} and \textit{V. A. Oleshchuk}, Cybernetics 23, No. 5, 590--599 (1987; Zbl 0651.68101); translation from Kibernetika 1987, No. 5, 19--25 (1987) Full Text: DOI OpenURL
Balsters, Herman Lambda calculus extended with segments. (English) Zbl 0651.03007 Mathematical logic and theoretical computer science, Lect. Notes Pure Appl. Math. 106, 15-27 (1987). Reviewer: G.Mints MSC: 03B40 PDF BibTeX XML OpenURL
Felleisen, Matthias; Friedman, Daniel P.; Kohlbecker, Eugene; Duba, Bruce A syntactic theory of sequential control. (English) Zbl 0643.03011 Theor. Comput. Sci. 52, 205-237 (1987). Reviewer: J.Zlatuska MSC: 03B40 68N01 68Q60 03B70 PDF BibTeX XML Cite \textit{M. Felleisen} et al., Theor. Comput. Sci. 52, 205--237 (1987; Zbl 0643.03011) Full Text: DOI OpenURL
Oyamaguchi, Michio The Church-Rosser property for ground term-rewriting systems is decidable. (English) Zbl 0641.68044 Theor. Comput. Sci. 49, 43-79 (1987). Reviewer: J.Zlatuska MSC: 68Q65 20M05 68Q45 68T15 08A50 20M35 PDF BibTeX XML Cite \textit{M. Oyamaguchi}, Theor. Comput. Sci. 49, 43--79 (1987; Zbl 0641.68044) Full Text: DOI OpenURL
Ryšlinková, Jana Church-Rosser property and decidability of monadic theories of unary algebras. (English) Zbl 0639.03008 RAIRO, Inf. Théor. Appl. 21, 323-329 (1987). Reviewer: M.Tetruašvili MSC: 03B25 08A60 PDF BibTeX XML Cite \textit{J. Ryšlinková}, RAIRO, Inform. Théor. Appl. 21, 323--329 (1987; Zbl 0639.03008) Full Text: DOI EuDML OpenURL
Anisimov, A. V.; Oleshchuk, V. A. Church-Rosser systems with respect to the equivalence module. (Russian. English summary) Zbl 0637.03032 Dokl. Akad. Nauk Ukr. SSR, Ser. A 1987, No. 9, 71-74 (1987). Reviewer: S.P.Jukna MSC: 03D03 PDF BibTeX XML Cite \textit{A. V. Anisimov} and \textit{V. A. Oleshchuk}, Dokl. Akad. Nauk Ukr. SSR, Ser. A 1987, No. 9, 71--74 (1987; Zbl 0637.03032) OpenURL
Benninghofen, B.; Kemmerich, S.; Richter, M. M. [Otto, F.] Systems of reductions. (English) Zbl 0636.68027 Lecture Notes in Computer Science, 277. Berlin etc.: Springer-Verlag. X, 265 p.; DM 40.50 (1987). Reviewer: J.Zlatuska MSC: 68Q65 08A50 20F10 20M35 03D60 68Q25 68Q45 68T15 68-02 03B25 PDF BibTeX XML OpenURL
Lange, Klaus-Jörn; Welzl, Emo String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing. (English) Zbl 0619.68064 Discrete Appl. Math. 16, 17-30 (1987). MSC: 68Q45 68N20 68Q25 PDF BibTeX XML Cite \textit{K.-J. Lange} and \textit{E. Welzl}, Discrete Appl. Math. 16, 17--30 (1987; Zbl 0619.68064) Full Text: DOI OpenURL
Castellani, Ilaria Bisimulations and abstraction homomorphisms. (English) Zbl 0619.68021 J. Comput. Syst. Sci. 34, 210-235 (1987). MSC: 68N25 PDF BibTeX XML Cite \textit{I. Castellani}, J. Comput. Syst. Sci. 34, 210--235 (1987; Zbl 0619.68021) Full Text: DOI OpenURL
Squier, Craig C. Units of special Church-Rosser monoids. (English) Zbl 0616.20029 Theor. Comput. Sci. 49, 13-22 (1987). Reviewer: P.M.Higgins MSC: 20M05 20M35 68Q45 PDF BibTeX XML Cite \textit{C. C. Squier}, Theor. Comput. Sci. 49, 13--22 (1987; Zbl 0616.20029) Full Text: DOI OpenURL
Jouannaud, Jean-Pierre; Kirchner, Hélène Completion of a set of rules modulo a set of equations. (English) Zbl 0665.03005 SIAM J. Comput. 15, 1155-1194 (1986). Reviewer: A.Pettorossi MSC: 03B25 08B05 68Q65 03C05 PDF BibTeX XML Cite \textit{J.-P. Jouannaud} and \textit{H. Kirchner}, SIAM J. Comput. 15, 1155--1194 (1986; Zbl 0665.03005) Full Text: DOI OpenURL
Toyama, Yoshihito How to prove equivalence of term rewriting systems without induction. (English) Zbl 0642.68033 Automated deduction, Proc. 8th Int. Conf., Oxford/Engl. 1986, Lect. Notes Comput. Sci. 230, 118-127 (1986). MSC: 68Q65 68T15 08B05 PDF BibTeX XML OpenURL
Janssens, D.; Rozenberg, G. Neighborhood-uniform NLC grammars. (English) Zbl 0624.68061 Comput. Vision Graphics Image Process. 35, 131-151 (1986). MSC: 68Q45 PDF BibTeX XML Cite \textit{D. Janssens} and \textit{G. Rozenberg}, Comput. Vis. Graph. Image Process. 35, 131--151 (1986; Zbl 0624.68061) Full Text: DOI OpenURL
Winkler, F.; Buchberger, B. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm. (English) Zbl 0607.03003 Algebra, combinatorics and logic in computer science, Colloq. Györ/Hung. 1983, Vol. 2, Colloq. Math. Soc. János Bolyai 42, 849-869 (1986). MSC: 03B35 68T15 08B05 PDF BibTeX XML OpenURL
Toyama, Yoshihito On equivalence transformations for term rewriting systems. (English) Zbl 0591.68042 Software science and engineering II, Proc. RIMS Symp. 1983/84, Kyoto/Jap., Lect. Notes Comput. Sci. 220, 44-61 (1986). MSC: 68Q65 PDF BibTeX XML OpenURL
Otto, Friedrich; Wrathall, Celia A note on Thue systems with a single defining relation. (English) Zbl 0601.03015 Math. Syst. Theory 18, 135-143 (1985). Reviewer: A.Pettorossi MSC: 03D03 68Q65 PDF BibTeX XML Cite \textit{F. Otto} and \textit{C. Wrathall}, Math. Syst. Theory 18, 135--143 (1985; Zbl 0601.03015) Full Text: DOI OpenURL
Pan, Luquan On reduced Thue systems. (English) Zbl 0593.03022 Math. Syst. Theory 18, 145-151 (1985). Reviewer: S.P.Yukna MSC: 03D03 03D35 03D40 PDF BibTeX XML Cite \textit{L. Pan}, Math. Syst. Theory 18, 145--151 (1985; Zbl 0593.03022) Full Text: DOI OpenURL
Kapur, Deepak; Narendran, Paliath A finite Thue system with decidable word problem and without equivalent finite canonical system. (English) Zbl 0588.03023 Theor. Comput. Sci. 35, 337-344 (1985). Reviewer: S.P.Yukna MSC: 03D03 03D40 20M05 PDF BibTeX XML Cite \textit{D. Kapur} and \textit{P. Narendran}, Theor. Comput. Sci. 35, 337--344 (1985; Zbl 0588.03023) Full Text: DOI OpenURL
Narendran, Paliath; Otto, Friedrich Complexity results on the conjugacy problem for monoids. (English) Zbl 0588.03022 Theor. Comput. Sci. 35, 227-243 (1985). Reviewer: S.P.Yukna MSC: 03D03 03D15 03D30 03D40 20M05 PDF BibTeX XML Cite \textit{P. Narendran} and \textit{F. Otto}, Theor. Comput. Sci. 35, 227--243 (1985; Zbl 0588.03022) Full Text: DOI OpenURL
Book, Ronald V. Thue systems as rewriting systems. (English) Zbl 0587.03026 Rewriting techniques and applications, 1st Int. Conf., Dijon/France 1985, Lect. Notes Comput. Sci. 202, 63-94 (1985). Reviewer: D.Lucanu MSC: 03D03 03D40 20M05 68Q65 PDF BibTeX XML OpenURL
Kapur, D.; Narendran, P.; Krishnamoorthy, M. S.; McNaughton, R. The Church-Rosser property and special Thue systems. (English) Zbl 0586.03028 Theor. Comput. Sci. 39, 123-133 (1985). MSC: 03D03 20M05 68Q65 20M35 68Q25 PDF BibTeX XML Cite \textit{D. Kapur} et al., Theor. Comput. Sci. 39, 123--133 (1985; Zbl 0586.03028) Full Text: DOI OpenURL
Jantzen, M. A note on a special one-rule semi-Thue system. (English) Zbl 0581.68030 Inf. Process. Lett. 21, 135-140 (1985). MSC: 68-01 68W30 03D03 03D40 PDF BibTeX XML Cite \textit{M. Jantzen}, Inf. Process. Lett. 21, 135--140 (1985; Zbl 0581.68030) Full Text: DOI OpenURL
Dauchet, M.; Tison, S. Decidability of confluence for ground term rewriting systems. (English) Zbl 0579.68023 Fundamentals of computation theory, Proc. 5th Int. Conf., Cottbus/Ger. 1985, Lect. Notes Comput. Sci. 199, 80-89 (1985). Reviewer: J.Zlatuska MSC: 68Q65 68Q45 08A50 08B99 PDF BibTeX XML OpenURL
Winkler, F.; Buchberger, B.; Lichtenberger, F.; Rolletschek, H. Algorithm 628. An algorithm for constructing canonical bases of polynomial ideals. (English) Zbl 0575.68047 ACM Trans. Math. Softw. 11, 66-78 (1985). Reviewer: Ş.Buzeţeanu MSC: 68W30 13-04 13F20 PDF BibTeX XML Cite \textit{F. Winkler} et al., ACM Trans. Math. Softw. 11, 66--78 (1985; Zbl 0575.68047) Full Text: DOI Link OpenURL
Castellani, Ilaria Bisimulations and abstraction homomorphisms. (English) Zbl 0563.68028 Mathematical foundations of software development, Proc. Int. Conf., Berlin 1985, Vol. 1: Colloq. Trees in algebra and programming, Lect. Notes Comput. Sci. 185, 223-238 (1985). MSC: 68N25 PDF BibTeX XML OpenURL
Book, Ronald V.; Otto, Friedrich Cancellation rules and extended word problems. (English) Zbl 0561.68030 Inf. Process. Lett. 20, 5-11 (1985). MSC: 68Q65 03D03 94A99 03D40 68Q45 PDF BibTeX XML Cite \textit{R. V. Book} and \textit{F. Otto}, Inf. Process. Lett. 20, 5--11 (1985; Zbl 0561.68030) Full Text: DOI OpenURL
Kasymov, N. Kh. Algebraic description of recursively enumerable data types. (Russian) Zbl 0584.68032 Vychisl. Sist. 101, 130-140 (1984). Reviewer: A.Kreczmar MSC: 68P05 68N01 08C15 03D45 PDF BibTeX XML Cite \textit{N. Kh. Kasymov}, Vychisl. Sist. 101, 130--140 (1984; Zbl 0584.68032) OpenURL
Perdrix, H. Propriétés Church-Rosser de systèmes de réecriture equationnels ayant la propriété de termination faible. (French) Zbl 0583.68005 Theoretical aspects of computer science, Symp., Paris 1984, Lect. Notes Comput. Sci. 166, 97-108 (1984). Reviewer: A.Pettorossi MSC: 68Q65 68T15 68Q55 PDF BibTeX XML OpenURL
Winkler, Franz The Church Rosser property in computer algebra and special theorem proving: an investigation of critical pair/completion algorithms. (English) Zbl 0562.68023 Dissertationen der Johannes Kepler-Universität Linz, 49. Linz: Johannes Kepler-Universität; Wien: Verband der Wissenschaftlichen Gesellschaften Österreichs (VWGÖ) 193 p. ÖS 180.00; DM 27.00 (1984). Reviewer: V.Calmatuianu MSC: 68W30 68T15 68-02 PDF BibTeX XML OpenURL
Jantzen, Matthias Thue systems and the Church-Rosser property. (English) Zbl 0553.03025 Mathematical foundations of computer science, Proc. 11th Symp., Praha/Czech. 1984, Lect. Notes Comput. Sci. 176, 80-95 (1984). MSC: 03D03 68Q65 03C05 PDF BibTeX XML OpenURL
Book, Ronald V. Homogeneous Thue systems and the Church-Rosser property. (English) Zbl 0546.03019 Discrete Math. 48, 137-145 (1984). Reviewer: M.Demlová MSC: 03D03 03D40 20M05 PDF BibTeX XML Cite \textit{R. V. Book}, Discrete Math. 48, 137--145 (1984; Zbl 0546.03019) Full Text: DOI OpenURL
Gyachas, K. On the interaction in distributed programs. (Russian. English summary) Zbl 0564.68015 Avtom. Protsessov Planirovaniya Upr. 10, 58-71 (1983). MSC: 68N25 68Q60 PDF BibTeX XML OpenURL
Horster, Patrick Reduktionssysteme, formale Sprachen und Automatentheorie. (German) Zbl 0563.03021 Mathematisch-Naturwissenschaftliche Fakultät der Rheinisch- Westfälischen Technischen Hochschule Aachen. 72 S. (1983). Reviewer: R.Nabert MSC: 03D03 03D05 03D40 03B25 68Q65 68T20 PDF BibTeX XML OpenURL