The Rewriting Calculus as a Combinatory Reduction System

DOI10.1007/978-3-540-71389-0_7zbMATH Open1195.68051OpenAlexW1502925263MaRDI QIDQ5758041FDOQ5758041

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

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

Mathematics Subject Classification ID

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

Cited In (15)

• Lambda calculus with patterns
• Term Rewriting and Applications
• Sharing in the graph rewriting calculus
• The simply typed rewriting calculus
• Expressing combinatory reduction systems derivations in the rewriting calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elimination transformations for associative-commutative rewriting systems
• Title not available (Why is that?)
• Computing with rewrite systems
• Rewriting calculus with(out) types
• Converting between Combinatory Reduction Systems and Big Step Semantics
• Distributive \(\rho\)-calculus
• The rewriting calculus. I
• iRho: an imperative rewriting 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)