Polymorphic rewriting conserves algebraic confluence
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4124996
- 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
Cited in
(17)- Polymorphic rewriting conserves algebraic strong normalization
- Unary PCF is decidable
- Modularity of confluence: A simplified proof
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints
- Polymorphic rewrite rules: confluence, type inference, and instance validation
- Normal forms in combinatory logic
- scientific article; zbMATH DE number 4124996 (Why is no real title available?)
- 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
- Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
- On the power of simple diagrams
- Confluence of algebraic rewriting systems
- Finitary PCF is not decidable
- Congruence types
- Rewriting with extensional polymorphic \(\lambda \)-calculus
- On the confluence of lambda-calculus with conditional rewriting
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)
