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
Pottinger, Garrel The Church-Rosser theorem for the typed lambda-calculus with pairing pairing. (English) Zbl 0476.03026 Notre Dame J. Formal Logic 22, 264-268 (1981). MSC: 03B40 PDFBibTeX XMLCite \textit{G. Pottinger}, Notre Dame J. Formal Logic 22, 264--268 (1981; Zbl 0476.03026) Full Text: DOI
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
Huet, Gerard Confluent reductions: Abstract properties and applications to term rewriting systems. (English) Zbl 0458.68007 J. Assoc. Comput. Mach. 27, 797-821 (1980). MSC: 68Q65 68Q60 PDFBibTeX XMLCite \textit{G. Huet}, J. Assoc. Comput. Mach. 27, 797--821 (1980; Zbl 0458.68007) Full Text: DOI
Pottinger, Garrel The Church-Rosser theorem for the typed \(\lambda\)-calculus with surjective pairing. (English) Zbl 0423.03009 Notre Dame J. Formal Logic (to appear). MSC: 03B40 PDFBibTeX XML
van Daalen, Diederik Ton The language theory of Automath. (English) Zbl 0422.68045 Eindhoven: Technische Hogeschool. VI, 309 p. (1980). MSC: 68T15 68T99 68-02 03B40 03B35 03-02 PDFBibTeX XML
Ehrig, H.; Kreowski, H.-J. Algebraic theory of graph grammars applied to consistency and synchronization in data base systems. (English) Zbl 0395.68074 Appl. Comput. Sci., Ber. Prakt. Inf. 13, 227-243 (1979). MSC: 68Q45 68P05 PDFBibTeX XMLCite \textit{H. Ehrig} and \textit{H. J. Kreowski}, Appl. Comput. Sci., Ber. Prakt. Inf. 13, 227--243 (1979; Zbl 0395.68074)