A formal system of reduction paths for parallel reduction
From MaRDI portal
Recommendations
Cites work
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- A simplified proof of the Church-Rosser theorem
- Complete rewriting systems and homology of monoid algebras
- Compositional Z: confluence proofs for permutative conversion
- Exact bounds for lengths of reductions in typed -calculus
- Finitary higher inductive types in the groupoid model
- scientific article; zbMATH DE number 3853055 (Why is no real title available?)
- scientific article; zbMATH DE number 5318491 (Why is no real title available?)
- scientific article; zbMATH DE number 2228448 (Why is no real title available?)
- scientific article; zbMATH DE number 3083488 (Why is no real title available?)
- Least upper bounds on the size of confluence and Church-Rosser diagrams in term rewriting and -calculus
- Lectures on the Curry-Howard isomorphism
- Parallel reductions in \(\lambda\)-calculus
- The Church-Rosser theorem and quantitative analysis of witnesses
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The typed lambda-calculus is not elementary recursive
This page was built for publication: A formal system of reduction paths for parallel reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1989338)