Context rewriting

DOI10.1007/3-540-56393-8_2OpenAlexW2913293979MaRDI QIDQ5881173

Stefan Kahrs

Publication date: 9 March 2023

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

Full work available at URL: https://doi.org/10.1007/3-540-56393-8_2

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Enriched categories (over closed or monoidal categories) (18D20)

Related Items

Developing developments ⋮ On equal \(\mu \)-terms ⋮ A typed context calculus ⋮ Viewing \({\lambda}\)-terms through maps

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Higher-order unification revisited: Complete sets of transformations
• Sequential evaluation strategies for parallel-or and related reduction systems
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A logic programming language with lambda-abstraction, function variables, and simple unification
• An abstract formulation for rewrite systems
• On the Church-Rosser property for the direct sum of term rewriting systems
• An Abstract form of the church-rosser theorem. I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item