Call-by-value combinatory logic and the lambda-value calculus
From MaRDI portal
Recommendations
Cites work
- A new implementation technique for applicative languages
- A simplification of combinatory logic
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Combinatory logic. With two sections by William Craig.
- Director strings as combinators
- scientific article; zbMATH DE number 3907755 (Why is no real title available?)
- scientific article; zbMATH DE number 3502750 (Why is no real title available?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- What is a model of the lambda calculus?
Cited in
(15)- A formal equational theory for call-by-push-value
- Positive supercompilation for a higher-order call-by-value language
- Call-By-Push-Value from a Linear Logic Point of View
- The Value-Passing Calculus
- The Call-by-Need Lambda Calculus, Revisited
- scientific article; zbMATH DE number 2185674 (Why is no real title available?)
- scientific article; zbMATH DE number 1086682 (Why is no real title available?)
- scientific article; zbMATH DE number 2044494 (Why is no real title available?)
- scientific article; zbMATH DE number 1497774 (Why is no real title available?)
- scientific article; zbMATH DE number 6825409 (Why is no real title available?)
- The call-by-value λ-calculus: a semantic investigation
- scientific article; zbMATH DE number 7340561 (Why is no real title available?)
- scientific article; zbMATH DE number 7356671 (Why is no real title available?)
- Standardization of a Call-By-Value Lambda-Calculus
- Extended call-by-push-value: reasoning about effectful programs and evaluation order
This page was built for publication: Call-by-value combinatory logic and the lambda-value calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6171751)