The rewriting calculus - part II

DOI10.1093/JIGPAL/9.3.377zbMath0986.03027OpenAlexW2053801514MaRDI QIDQ2720294

Claude Kirchner, Horatiu Cirstea

Publication date: 6 June 2002

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/9.3.377

zbMATH Keywords

operational semanticsnondeterminismlambda-calculusELAN programsrewriting-calculusrho-calculusrule based language

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (12)

Sharing in the Graph Rewriting Calculus ⋮ Nominal rewriting ⋮ Expressing combinatory reduction systems derivations in the rewriting calculus ⋮ A \(\rho\)-calculus of explicit constraint application ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Typed path polymorphism ⋮ Expression reduction systems with patterns ⋮ Type soundness for path polymorphism ⋮ Unnamed Item ⋮ An Interaction Net Encoding of Gödel’s System  $$\mathcal {T}$$ ⋮ A Higher-Order Graph Calculus for Autonomic Computing

Uses Software

• Unnamed Item

This page was built for publication: The rewriting calculus - part II