Radzikowski, Pawel Bracket-context tree functions. (English) Zbl 0567.68048 Combinatorics on words. Progress and perspectives, Proc. Int. Meet., Waterloo/Can. 1982, 357-385 (1983). Reviewer: M.Steinby MSC: 68Q45 68T10 PDFBibTeX XML
Zhaldokas, Rimgaudas An approach to the construction of complete systems of term rewriting rules. (Russian. English summary) Zbl 0558.68029 Mat. Logika Primen. 3, 9-22 (1983). MSC: 68Q65 68P05 PDFBibTeX XMLCite \textit{R. Zhaldokas}, Mat. Logika Primen. 3, 9--22 (1983; Zbl 0558.68029)
Paulson, Lawrence A higher-order implementation of rewriting. (English) Zbl 0551.68076 Sci. Comput. Program. 3, 119-149 (1983). Reviewer: M.M.Richter MSC: 68T15 68Q65 03D60 68W30 PDFBibTeX XMLCite \textit{L. Paulson}, Sci. Comput. Program. 3, 119--149 (1983; Zbl 0551.68076) Full Text: DOI arXiv
Błażewicz, Jacek; Pettorossi, Alberto Some properties of binary sequences useful for proving Collatz’s conjecture. (English) Zbl 0547.10006 Found. Control Eng. 8, 53-63 (1983). Reviewer: S.Yukna MSC: 11A63 PDFBibTeX XMLCite \textit{J. Błażewicz} and \textit{A. Pettorossi}, Found. Control Eng. 8, 53--63 (1983; Zbl 0547.10006)
Guttag, J. V.; Kapur, D.; Musser, D. R. On proving uniform termination and restricted termination of rewriting systems. (English) Zbl 0526.68036 SIAM J. Comput. 12, 189-214 (1983). MSC: 68Q65 68T15 PDFBibTeX XMLCite \textit{J. V. Guttag} et al., SIAM J. Comput. 12, 189--214 (1983; Zbl 0526.68036) Full Text: DOI
Padawitz, Peter Correctness, completeness and consistency of equational data type specifications. (Thesis). (English) Zbl 0525.68007 Fachbereich Informatik der Technischen Universität Berlin. 256 p. (1983). MSC: 68Q60 68Q65 68P05 PDFBibTeX XML
Hsiang, Jieh; Dershowitz, Nachum Rewrite methods for clausal and non-clausal theorem proving. (English) Zbl 0523.68080 Automata, languages and programming, 10th Colloq., Barcelona/Spain 1983, Lect. Notes Comput. Sci. 154, 331-346 (1983). MSC: 68T15 68N01 68P05 03B35 PDFBibTeX XML
Furtado, A. L.; Veloso, P. A. S. Specification of data bases through rewriting rules. (English) Zbl 0522.68096 Graph-grammars and their application to computer science, 2nd int. Workshop, Haus Ohrbeck/Ger. 1982, Lect. Notes Comput. Sci. 153, 102-113 (1983). MSC: 68P20 68P05 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
Moeller, Bernhard An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language. (English) Zbl 0521.68016 Automata, languages and programming, 10th Colloq., Barcelona/Spain 1983, Lect. Notes Comput. Sci. 154, 513-526 (1983). MSC: 68Q60 PDFBibTeX XML
Jouannaud, Jean-Pierre; Kirchner, Claude; Kirchner, Helene Incremental construction of unification algorithms in equational theories. (English) Zbl 0516.68067 Automata, languages and programming, 10th Colloq., Barcelona/Spain 1983, Lect. Notes Comput. Sci. 154, 361-373 (1983). MSC: 68T15 08A50 03B35 03E20 PDFBibTeX XML
Jouannaud, Jean-Pierre; Lescanne, Pierre; Reinig, Fernand Recursive decomposition ordering. (English) Zbl 0513.68026 Formal description of programming concepts II, Proc. IFIP Conf., Garmisch-Partenkirchen 1982, 331-348 (1983). MSC: 68Q65 PDFBibTeX XML Full Text: EuDML
Engels, G.; Pletat, U.; Ehrich, H.-D. An operational semantics for specifications of abstract data types with error handling. (English) Zbl 0489.68013 Acta Inf. 19, 235-253 (1983). MSC: 68P05 PDFBibTeX XMLCite \textit{G. Engels} et al., Acta Inf. 19, 235--253 (1983; Zbl 0489.68013) Full Text: DOI