Redexes are stable in the -calculus
From MaRDI portal
Publication:5269004
Recommendations
Cites work
- scientific article; zbMATH DE number 3821120 (Why is no real title available?)
- scientific article; zbMATH DE number 3988695 (Why is no real title available?)
- scientific article; zbMATH DE number 4005580 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 627411 (Why is no real title available?)
- scientific article; zbMATH DE number 1042221 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- A global representation of the recursive functions in the \(\lambda\)- calculus
- Analysis and caching of dependencies
- Combinatory logic. Vol. II
- Four equivalent equivalences of reductions
- From Semantics to Computer Science
- Full abstraction for PCF
- LCF considered as a programming language
- Minimal and Optimal Computations of Recursive Programs
- Paths, computations and labels in the \(\lambda\)-calculus
- Sequential algorithms on concrete data structures
- The lambda calculus. Its syntax and semantics. Rev. ed.
This page was built for publication: Redexes are stable in the \(\lambda\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269004)