Computing in systems described by equations

Publication date: 1977

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

operational semantics equational logic termination functional programming term rewriting lambda calculus combinatory logic recursive equations Church-Rosser property LISP subtree replacement systems interpreters confluence property optimality of the rewriting process relationship with other semantics definitions

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Equational logic, Mal'tsev conditions (08B05) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items (66)

Collapsed tree rewriting: Completeness, confluence, and modularity ⋮ Normalization by leftmost innermost rewriting ⋮ Extended term rewriting systems ⋮ Infinite terms and infinite rewritings ⋮ Testing confluence of nonterminating rewriting systems ⋮ Reductions in tree replacement systems ⋮ Algebraic semantics and complexity of term rewriting systems ⋮ Transforming strongly sequential rewrite systems with constructors for efficient parallel execution ⋮ Confluence and superdevelopments ⋮ Topics in termination ⋮ Optimal normalization in orthogonal term rewriting systems ⋮ Lazy rewriting and eager machinery ⋮ Termination of rewriting ⋮ Simplifying conditional term rewriting systems: Unification, termination and confluence ⋮ Unification modulo an equality theory for equational logic programming ⋮ Herbrand theorems in arbitrary institutions ⋮ Conditional rewrite rules: Confluence and termination ⋮ Decidable sentences of Church-Rosser congruences ⋮ Full abstraction and limiting completeness in equational languages ⋮ Enumerating outer narrowing derivations for constructor-based term rewriting systems ⋮ Higher-order rewrite systems and their confluence ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ Default rules for Curry ⋮ Unnamed Item ⋮ Hierarchical development of programming languages ⋮ A rationale for conditional equational programming ⋮ Tree equivalence of linear recursive schemata is polynomial-time decidable ⋮ Termination of just/fair computations in term rewriting ⋮ Rewrite, rewrite, rewrite, rewrite, rewrite, \dots ⋮ Evaluation strategies for functional logic programming ⋮ Exploring conditional rewriting logic computations ⋮ Sequentiality in orthogonal term rewriting systems ⋮ A sequential reduction strategy ⋮ On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems ⋮ Logic and functional programming by retractions : operational semantics ⋮ Confluence theory for graphs ⋮ Modularity in noncopying term rewriting ⋮ Natural termination ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ On abstract normalisation beyond neededness ⋮ New Undecidability Results for Properties of Term Rewrite Systems ⋮ Decidable call-by-need computations in term rewriting ⋮ Programming with narrowing: a tutorial ⋮ Conditional linearization ⋮ Unnamed Item ⋮ On interreduction of semi-complete term rewriting systems ⋮ From LCF to Isabelle/HOL ⋮ On the longest perpetual reductions in orthogonal expression reduction systems ⋮ Unnamed Item ⋮ Term-rewriting systems with rule priorities ⋮ Algebraic and operational semantics of specifications allowing exceptions and errors ⋮ Evolving combinators ⋮ Evaluation Strategies for Functional Logic Programming ⋮ Pattern-matching algorithms based on term rewrite systems ⋮ Approximation properties of abstract data types ⋮ Fundamental properties of infinite trees ⋮ Models of programs and processes ⋮ Sequentiality, monadic second-order logic and tree automata. ⋮ On the correspondence between two classes of reduction systems ⋮ Descendants and origins in term rewriting. ⋮ Perpetuality and uniform normalization in orthogonal rewrite systems ⋮ Verifying abstract data types with SNOBOL4 ⋮ Conditional rewrite rules ⋮ Transformations of structures: An algebraic approach ⋮ On Term-Graph Rewrite Strategies ⋮ Origin tracking

This page was built for publication: Computing in systems described by equations