Reduction graphs in the lambda calculus
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3851045 (Why is no real title available?)
- scientific article; zbMATH DE number 3672266 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3609633 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- scientific article; zbMATH DE number 3423994 (Why is no real title available?)
- Infinite graphs—A survey
- Lambda-calculus terms that reduce to themselves
- Parallel concepts in graph theory
- The lambda calculus, its syntax and semantics
- Varieties of ordered algebras
Cited in
(12)- More problems in rewriting
- Three Syntactic Theories for Combinatory Graph Reduction
- scientific article; zbMATH DE number 1868923 (Why is no real title available?)
- Open problems in rewriting
- scientific article; zbMATH DE number 7084951 (Why is no real title available?)
- Anagopos: a reduction graph visualizer for term rewriting and lambda calculus
- The combinator M and the Mockingbird lattice
- scientific article; zbMATH DE number 1546504 (Why is no real title available?)
- Refining reduction in the lambda calculus
- One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus
- Orders, reduction graphs and spectra
- Needed reduction and spine strategies for the lambda calculus
This page was built for publication: Reduction graphs in the lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792994)
