Sequentiality in orthogonal term rewriting systems

DOI10.1016/S0747-7171(08)80124-1zbMath0746.68047OpenAlexW2158205039MaRDI QIDQ1186735

Jan Willem Klop, Aart Middeldorp

Publication date: 28 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80124-1

zbMATH Keywords

term rewriting systemsdecidability of strong sequentiality

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (21)

Optimal solutions to pattern matching problems ⋮ Constructor equivalent term rewriting systems are strongly sequential: A direct proof ⋮ Rules + strategies for transforming lazy functional logic programs ⋮ Strongly sequential and inductively sequential term rewriting systems ⋮ Root-neededness and approximations of neededness ⋮ Optimal normalization in orthogonal term rewriting systems ⋮ Decidable approximations of term rewriting systems ⋮ Semantics and strong sequentially of priority term rewriting systems ⋮ A Needed Rewriting Strategy for Data-Structures with Pointers ⋮ Constructor equivalent term rewriting systems ⋮ Decidable call-by-need computations in term rewriting ⋮ Lazy productivity via termination ⋮ Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs ⋮ Semantics and strong sequentiality of priority term rewriting systems ⋮ Strong and NV-sequentiality of constructor systems ⋮ Decidable call by need computations in term rewriting (extended abstract) ⋮ A hybrid programming scheme combining fuzzy-logic and functional-logic resources ⋮ Normalization, approximation, and semantics for combinator systems ⋮ Sequentiality, monadic second-order logic and tree automata. ⋮ Context-sensitive rewriting strategies ⋮ On Term-Graph Rewrite Strategies

Cites Work

• Modular properties of conditional term rewriting systems
• A refinement of strong sequentiality for term rewriting with constructors
• Needed reduction and spine strategies for the lambda calculus
• Conditional rewrite rules: Confluence and termination
• Computing in systems described by equations
• Sequential evaluation strategies for parallel-or and related reduction systems
• Implementation of an interpreter for abstract equations
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Minimal and Optimal Computations of Recursive Programs
• On the Church-Rosser property for the direct sum of term rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequentiality in orthogonal term rewriting systems