Publication:3776590

From MaRDI portal


zbMath0636.68004MaRDI QIDQ3776590

Michael J. O'Donnell

Publication date: 1985



03B70: Logic in computer science

68Q65: Abstract data types; algebraic specification

68-02: Research exposition (monographs, survey articles) pertaining to computer science

68N01: General topics in the theory of software

03B40: Combinatory logic and lambda calculus


Related Items

Transformations and confluence for rewrite systems, Modularity in noncopying term rewriting, Testing for the ground (co-)reducibility property in term-rewriting systems, About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus, Subset-equational programming in intelligent decision systems, Modular term rewriting systems and the termination, Implementing term rewrite languages in DACTL, Conditional equational theories and complete sets of transformations, Parallel scheduling of recursively defined arrays, Conditional rewrite rules: Confluence and termination, Fast Knuth-Bendix completion with a term rewriting system compiler, Enumerating outer narrowing derivations for constructor-based term rewriting systems, Rewrite, rewrite, rewrite, rewrite, rewrite, \dots, When is an extension of a specification consistent? Decidable and undecidable cases, Conditional rewriting logic as a unified model of concurrency, Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Tight complexity bounds for term matching problems, Subsumption computed algebraically, Term-rewriting systems with rule priorities, Equational programming in \(\lambda\)-calculus via SL-systems. Part 1, More efficient left-to-right matching for overlapping pattern, Unification modulo an equality theory for equational logic programming, Finite Basis Theorems for Relatively Congruence-Distributive Quasivarieties, Implementation of an interpreter for abstract equations