Call-by-name extensionality and confluence
From MaRDI portal
Publication:5372008
Recommendations
- A confluent reduction for the extensional typed \(\lambda\)-calculus with pairs, sums, recursion and terminal object
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
- Simulating expansions without expansions
- On modular properties of higher order extensional lambda calculi
- Extensional Rewriting with Sums
Cites work
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 2061706 (Why is no real title available?)
- scientific article; zbMATH DE number 2110615 (Why is no real title available?)
- A call-by-name lambda-calculus machine
- An approach to call-by-name delimited continuations
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Completeness of continuation models for \(\lambda_\mu\)-calculus
- Parametric polymorphism and operational equivalence
- Polarised intermediate representation of lambda calculus with sums
- Reduction system for extensional lambda-mu calculus
- Skew confluence and the lambda calculus with letrec
- The Duality of Construction
- The duality of computation
- The duality of computation under focus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The stack calculus
- Typing streams in the \({\Lambda}{\mu}\)-calculus
- Unique normal forms for lambda calculus with surjective pairing
- \(\lambda\mu\)-calculus and Böhm's theorem
This page was built for publication: Call-by-name extensionality and confluence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5372008)
