Polymorphic rewriting conserves algebraic confluence

DOI10.1006/INCO.1994.1078zbMATH Open0820.68059OpenAlexW2044646445MaRDI QIDQ1336046FDOQ1336046

Val Breazu-Tannen, Jean 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

Recommendations

• Publication:4205074
• Polymorphic rewriting conserves algebraic strong normalization
• Adding algebraic rewriting to the untyped lambda calculus
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
• Confluence of the lambda calculus with left-linear algebraic rewriting

zbMATH Keywords

polymorphic lambda term rewritingalgebraic term rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (15)

• Finitary PCF is not decidable
• Modularity of confluence: A simplified proof
• Rewriting with extensional polymorphic \(\lambda \)-calculus
• Polymorphic rewriting conserves algebraic strong normalization
• Title not available (Why is that?)
• On the confluence of lambda-calculus with conditional rewriting
• Normal forms in combinatory logic
• On modular properties of higher order extensional lambda calculi
• Unary PCF is decidable
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
• On the power of simple diagrams
• Confluence of algebraic rewriting systems
• Combining algebraic rewriting, extensional lambda calculi, and fixpoints
• Modularity of termination and confluence in combinations of rewrite systems with λω
• Combining first order algebraic rewriting systems, recursion and extensional lambda calculi

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336046)