Expressing combinatory reduction systems derivations in the rewriting calculus

DOI10.1007/S10990-006-0479-ZzbMath1112.68070OpenAlexW1965702337MaRDI QIDQ857913

Claude Kirchner, Clara Bertolissi, Horatiu Cirstea

Publication date: 5 January 2007

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-006-0479-z

zbMATH Keywords

MatchingCombinatory reduction systemsRewriting calculus

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A \(\rho\)-calculus of explicit constraint application
• The undecidability of the second-order unification problem
• A unification algorithm for typed \(\overline\lambda\)-calculus
• Combinatory reduction systems: Introduction and survey
• Abstract data type systems
• The rewriting calculus - part II
• Pure patterns type systems
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• Modularity of strong normalization in the algebraic-λ-cube
• A formulation of the simple theory of types
• The Clausal Theory of Types

This page was built for publication: Expressing combinatory reduction systems derivations in the rewriting calculus