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 PDFBibTeX XMLCite \textit{M. Kanovich}, Lect. Notes Comput. Sci. 4514, 284--292 (2007; Zbl 1133.05006) Full Text: DOI
Vejjajiva, Pimpen; Hall, Mark E. A lambda-calculus with patterns. (English) Zbl 1070.03506 Proceedings of the international conference on algebra and its applications (ICAA 2002), Chulalongkorn University, Bangkok, Thailand, March 18–20, 2002. Bangkog: Chulalongkorn University, Department of Mathematics (ISBN 970-13-2182-1). 266-277 (2002). MSC: 03B40 PDFBibTeX XMLCite \textit{P. Vejjajiva} and \textit{M. E. Hall}, in: Proceedings of the international conference on algebra and its applications (ICAA 2002), Chulalongkorn University, Bangkok, Thailand, March 18--20, 2002. Bangkog: Chulalongkorn University, Department of Mathematics. 266--277 (2002; Zbl 1070.03506)
Struth, Georg Calculating Church-Rosser proofs in Kleene algebra. (English) Zbl 1027.68071 de Swart, Harrie C. M. (ed.), Relational methods in computer science. 6th international conference, RelMiCS 2001 and 1st workshop of COST Action 274 TARSKI, Oisterwijk, The Netherlands, October 16-21, 2001. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2561, 276-290 (2002). MSC: 68Q42 68Q70 03B40 PDFBibTeX XMLCite \textit{G. Struth}, Lect. Notes Comput. Sci. 2561, 276--290 (2002; Zbl 1027.68071) Full Text: Link
Aczel, Peter Notes on the simply typed lambda calculus. (English) Zbl 0933.03007 Berger, Ulrich (ed.) et al., Computational logic. Proceedings of the NATO ASI, Marktoberdorf, Germany, July 29–August 10, 1997. Berlin: Springer. NATO ASI Ser., Ser. F, Comput. Syst. Sci. 165, 57-97 (1999). MSC: 03B40 03-02 03B20 03F03 03F35 03F50 PDFBibTeX XMLCite \textit{P. Aczel}, NATO ASI Ser., Ser. F, Comput. Syst. Sci. 165, 57--97 (1999; Zbl 0933.03007)
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 PDFBibTeX XMLCite \textit{P. de Groote}, Lect. Notes Comput. Sci. 665, 712--723 (1993; Zbl 0797.68144)
Ehrig, Hartmut; Parisi-Presicce, Francesco Algebraic specification grammars: A junction between module specifications and graph grammars. (English) Zbl 0765.68087 Graph grammars and their application to computer science, Proc. 4th Int. Workshop, Bremen/Ger. 1990, Lect. Notes Comput. Sci. 532, 292-310 (1991). MSC: 68Q42 68Q60 PDFBibTeX XMLCite \textit{H. Ehrig} and \textit{F. Parisi-Presicce}, Lect. Notes Comput. Sci. 532, 292--310 (1991; Zbl 0765.68087)
Ehrig, Hartmut; Habel, Annegret; Parisi-Presicce, Francesco From graph grammars to high level replacement systems. (English) Zbl 0765.68088 Graph grammars and their application to computer science, Proc. 4th Int. Workshop, Bremen/Ger. 1990, Lect. Notes Comput. Sci. 532, 269-291 (1991). MSC: 68Q42 68Q60 PDFBibTeX XMLCite \textit{H. Ehrig} et al., Lect. Notes Comput. Sci. 532, 269--291 (1991; Zbl 0765.68088)
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 PDFBibTeX XML
Padawitz, Peter Strategy-controlled reduction and narrowing. (English) Zbl 0635.68105 Rewriting techniques and applications, Proc. 2nd Int. Conf., Bordeaux/France 1987, Lect. Notes Comput. Sci. 256, 242-252 (1987). MSC: 68T15 03B35 PDFBibTeX XML
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 PDFBibTeX XML
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 PDFBibTeX XML
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 PDFBibTeX XML
Rice, Monique The construction of a complete minimal set of contextual normal forms. (English) Zbl 0549.68022 Computer algebra, EUROCAL ’83, Proc. Conf., London 1983, Lect. Notes Comput. Sci. 162, 255-266 (1983). MSC: 68Q65 PDFBibTeX XML
Jouannaud, Jean-Pierre Confluent and coherent equational term rewriting systems application to proofs in abstract data types. (English) Zbl 0522.68013 Trees in algebra and programming, CAAP ’83, Proc. 8th Colloq., L’Aquila/Italy 1983, Lect. Notes Comput. Sci. 159, 269-283 (1983). MSC: 68Q60 68W30 68P05 68T15 08A50 03F05 PDFBibTeX XML
Curry, Haskell B. Some philosophical aspects of combinatory logic. (English) Zbl 0479.03005 The Kleene Symp., Proc., Madison/Wis. 1978, Stud. Logic Found. Math., Vol. 101, 85-101 (1980). MSC: 03B40 03A05 03-02 03-03 PDFBibTeX XML