Polymorphic rewriting conserves algebraic confluence

DOI10.1006/inco.1994.1078zbMath0820.68059OpenAlexW2044646445MaRDI QIDQ1336046

Val Breazu-Tannen, Jean H. Gallier

Publication date: 12 October 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1597&context=cis_reports

zbMATH Keywords

polymorphic lambda term rewritingalgebraic term rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (11)

Adding algebraic rewriting to the untyped lambda calculus (extended abstract) ⋮ On the power of simple diagrams ⋮ Combining algebraic rewriting, extensional lambda calculi, and fixpoints ⋮ Normal forms in combinatory logic ⋮ On modular properties of higher order extensional lambda calculi ⋮ Modularity of termination and confluence in combinations of rewrite systems with λω ⋮ Combining first order algebraic rewriting systems, recursion and extensional lambda calculi ⋮ On the confluence of lambda-calculus with conditional rewriting ⋮ Finitary PCF is not decidable ⋮ Unary PCF is decidable ⋮ Modularity of confluence: A simplified proof

This page was built for publication: Polymorphic rewriting conserves algebraic confluence