Parallel reduction in type free lambda/mu-calculus
From MaRDI portal
Recommendations
- Parallel reductions in \(\lambda\)-calculus
- Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus
- Parallel reductions in \(\lambda\)-calculus
- Some properties of the \(\lambda\mu^{\wedge\vee}\)-calculus
- Confluency property of the call-by-value \(\lambda\mu^{\wedge\vee}\)-calculus
Cited in
(13)- Lambda-calculi for (strict) parallel functions
- An interpretation of \(\lambda \mu\)-calculus in \(\lambda\)-calculus.
- Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus
- Confluence proofs of lambda-mu-calculi by Z theorem
- Domain-free -calculus
- Confluency property of the call-by-value \(\lambda\mu^{\wedge\vee}\)-calculus
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
- scientific article; zbMATH DE number 1547348 (Why is no real title available?)
- Compositional Z: confluence proofs for permutative conversion
- The Maximum Length of Mu-Reduction in Lambda Mu-Calculus
- Parallel reductions in \(\lambda\)-calculus
- Parallel reductions in \(\lambda\)-calculus
- Adding Negation to Lambda Mu
This page was built for publication: Parallel reduction in type free lambda/mu-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2703743)
