An abstract monadic semantics for value recursion
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1692945 (Why is no real title available?)
- scientific article; zbMATH DE number 3952011 (Why is no real title available?)
- scientific article; zbMATH DE number 1956524 (Why is no real title available?)
- scientific article; zbMATH DE number 2038713 (Why is no real title available?)
- scientific article; zbMATH DE number 2087534 (Why is no real title available?)
- A calculus of module systems
- A new notation for arrows
- A syntactic approach to type soundness
- A type system for higher-order modules
- Compilation of extended recursion in call-by-value functional languages
- Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
- Functional and Logic Programming
- Generalising monads to arrows
- Premonoidal categories and notions of computation
- Recursive monadic bindings
- Semantics of value recursion for Monadic Input/Output
- The Mechanical Evaluation of Expressions
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The recursive record semantics of objects revisited
Cited in
(8)- Semantics of value recursion for Monadic Input/Output
- Comonadic notions of computation
- The Value-Passing Calculus
- Structuring operational semantics: simplification and computation
- scientific article; zbMATH DE number 5944670 (Why is no real title available?)
- Recursive monadic bindings
- Compilation of extended recursion in call-by-value functional languages
- Traced Premonoidal Categories
This page was built for publication: An abstract monadic semantics for value recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4659889)