Computing in systems described by equations
From MaRDI portal
Publication:1133323
zbMath0421.68038MaRDI QIDQ1133323
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
68Q65: Abstract data types; algebraic specification
08B05: Equational logic, Mal'tsev conditions
68N01: General topics in the theory of software
03B40: Combinatory logic and lambda calculus
Related Items
On interreduction of semi-complete term rewriting systems, On the longest perpetual reductions in orthogonal expression reduction systems, Decidable sentences of Church-Rosser congruences, A sequential reduction strategy, On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems, Modularity in noncopying term rewriting, Natural termination, Conditional linearization, Algebraic and operational semantics of specifications allowing exceptions and errors, A rationale for conditional equational programming, Fundamental properties of infinite trees, Models of programs and processes, On the correspondence between two classes of reduction systems, Conditional rewrite rules, Reductions in tree replacement systems, Termination of rewriting, Simplifying conditional term rewriting systems: Unification, termination and confluence, Conditional rewrite rules: Confluence and termination, 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, Hierarchical development of programming languages, Tree equivalence of linear recursive schemata is polynomial-time decidable, Rewrite, rewrite, rewrite, rewrite, rewrite, \dots, Sequentiality in orthogonal term rewriting systems, Conditional rewriting logic as a unified model of concurrency, Term-rewriting systems with rule priorities, Origin tracking, Pattern-matching algorithms based on term rewrite systems, Decidable call-by-need computations in term rewriting, Approximation properties of abstract data types, Sequentiality, monadic second-order logic and tree automata., Descendants and origins in term rewriting., Perpetuality and uniform normalization in orthogonal rewrite systems, Unification modulo an equality theory for equational logic programming, Unnamed Item, Logic and functional programming by retractions : operational semantics, Verifying abstract data types with SNOBOL4, Transformations of structures: An algebraic approach
