The Rewriting Calculus as a Combinatory Reduction System

DOI10.1007/978-3-540-71389-0_7MaRDI QIDQ5758041zbMATH OpenOpenAlexFDO

Authors Clara Bertolissi, Claude Kirchner

Publication date 7 September 2007

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71389-0_7

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Recommendations

• Expressing combinatory reduction systems derivations in the rewriting calculus
• The rewriting calculus. I
• scientific article; zbMATH DE number 1701351
• Distributive \(\rho\)-calculus
• Rewriting calculus with(out) types

Cited in

(15)

• The rewriting calculus. I
• iRho: an imperative rewriting calculus
• Lambda calculus with patterns
• Sharing in the graph rewriting calculus
• Term Rewriting and Applications
• The simply typed rewriting calculus
• Expressing combinatory reduction systems derivations in the rewriting calculus
• scientific article; zbMATH DE number 1303339 (Why is no real title available?)
• scientific article; zbMATH DE number 51605 (Why is no real title available?)
• Elimination transformations for associative-commutative rewriting systems
• scientific article; zbMATH DE number 3942987 (Why is no real title available?)
• Computing with rewrite systems
• Rewriting calculus with(out) types
• Converting between Combinatory Reduction Systems and Big Step Semantics
• Distributive \(\rho\)-calculus

This page was built for publication: The Rewriting Calculus as a Combinatory Reduction System

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758041)