Confluence of untyped lambda calculus via simple types
From MaRDI portal
(Redirected from Confluence of untyped lambda calculus via simple types)
Recommendations
- Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
- Adding algebraic rewriting to the untyped lambda calculus
- Confluence of the lambda calculus with left-linear algebraic rewriting
- New proofs of important theorems of untyped extensional \(\lambda\) calculus
- A direct proof of the confluence of combinatory strong reduction
Cited in
(8)- Skew confluence and the lambda calculus with letrec
- Reducibility: a ubiquitous method in lambda calculus with intersection types
- Untyped -calculus with relative typing
- scientific article; zbMATH DE number 431764 (Why is no real title available?)
- Unification in lambda-calculi with if-then-else
- Proving the genericity lemma by leftmost reduction is simple
- Simplified reducibility proofs of Church-Rosser for \({\beta}\)- and \({\beta}{\eta}\)-reduction
- A direct proof of the confluence of combinatory strong reduction
This page was built for publication: Confluence of untyped lambda calculus via simple types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448356)