The rewriting calculus - part I

DOI10.1093/jigpal/9.3.339zbMath0986.03026OpenAlexW4214577271MaRDI QIDQ2720293

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.339

zbMATH Keywords

nondeterminismlambda-calculusrewriting-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 (8)

Pattern matching as cut elimination ⋮ Nominal rewriting ⋮ The Negligible and Yet Subtle Cost of Pattern Matching ⋮ Typed generic traversal with term rewriting strategies ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Unnamed Item ⋮ A higher-order strategy for eliminating common subexpressions ⋮ Generic type-preserving traversal strategies

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