The functional machine calculus
From MaRDI portal
Cites work
- A call-by-name lambda-calculus machine
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Decomposing probabilistic lambda calculi
- Decomposing typed lambda calculus into a couple of categorical programming languages
- Functions as processes
- Generalising monads to arrows
- Guaranteeing safe destructive updates through a type system with uniqueness information for graphs
- Handlers of Algebraic Effects
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 2087441 (Why is no real title available?)
- scientific article; zbMATH DE number 2120508 (Why is no real title available?)
- scientific article; zbMATH DE number 1405668 (Why is no real title available?)
- scientific article; zbMATH DE number 7559490 (Why is no real title available?)
- Intensional interpretations of functionals of finite type I
- Modelling environments in call-by-value programming languages.
- Normalization by evaluation and algebraic effects
- Notions of computation and monads
- Parallel reductions in \(\lambda\)-calculus
- Premonoidal categories and notions of computation
- The enriched effect calculus: syntax and semantics
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The Mechanical Evaluation of Expressions
- Type inference in stack based languages
Cited in
(2)
This page was built for publication: The functional machine calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6831511)
