Extended term rewriting systems

DOI10.1007/3-540-54317-1_79OpenAlexW2124304012MaRDI QIDQ5881265

Jan Willem Klop, Roel de Vrijer

Publication date: 9 March 2023

Published in: Conditional and Typed Rewriting Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54317-1_79

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Open problems in rewriting ⋮ Conditional linearization ⋮ Descendants and origins in term rewriting.

Uses Software

• Haskell

Cites Work

• A rationale for conditional equational programming
• Conditional rewrite rules
• Simplifying conditional term rewriting systems: Unification, termination and confluence
• Conditional rewrite rules: Confluence and termination
• Unique normal forms for lambda calculus with surjective pairing
• Computing in systems described by equations
• The lambda calculus, its syntax and semantics
• Mathematical foundations of computer science 1975. 4th symposium, Mariánské Lázně, September 1--5, 1975
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Pairing Without Conventional Restraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extended term rewriting systems