scientific article
From MaRDI portal
Publication:3776590
zbMath0636.68004MaRDI QIDQ3776590
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamic programmingimplementationpattern matchingconcurrencynondeterminismterm rewriting systemsrecursive programsinterpreterequational programmingModularitycombinator calculusdataflow programs
Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)
Related Items
Extended term rewriting systems, Testing confluence of nonterminating rewriting systems, Strongly sequential and inductively sequential term rewriting systems, Optimization by non-deterministic, lazy rewriting, Transforming strongly sequential rewrite systems with constructors for efficient parallel execution, Classes of equational programs that compile into efficient machine code, Rewriting, and equational unification: the higher-order cases, Program transformation and rewriting, Incremental techniques for efficient normalization of nonlinear rewrite systems, Open problems in rewriting, More problems in rewriting, Implementation of an interpreter for abstract equations, Equational programming in \(\lambda\)-calculus via SL-systems. Part 1, Unification modulo an equality theory for equational logic programming, 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, Modular term rewriting systems and the termination, Implementing term rewrite languages in DACTL, Conditional equational theories and complete sets of transformations, Rewrite, rewrite, rewrite, rewrite, rewrite, \dots, When is an extension of a specification consistent? Decidable and undecidable cases, Transformations and confluence for rewrite systems, Modularity in noncopying term rewriting, Conditional rewriting logic as a unified model of concurrency, Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Testing for the ground (co-)reducibility property in term-rewriting systems, Tight complexity bounds for term matching problems, Subsumption computed algebraically, Programming with narrowing: a tutorial, Finite Basis Theorems for Relatively Congruence-Distributive Quasivarieties, Term-rewriting systems with rule priorities, Using well-founded relations for proving operational termination, About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus, Completeness of combinations of constructor systems, A semantics for nabla, More efficient left-to-right matching for overlapping pattern, Lazy Context Cloning for Non-Deterministic Graph Rewriting, Subset-equational programming in intelligent decision systems
