Semantics of value recursion for Monadic Input/Output
From MaRDI portal
Recommendations
Cites work
- A new notation for arrows
- Cyclic lambda calculi
- Deriving a lazy abstract machine
- Equivalence in functional languages with effects
- Generalising monads to arrows
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 819768 (Why is no real title available?)
- Models of sharing graphs. A categorical semantics of let and letrec
- Notions of computation and monads
- Parametric polymorphism and operational equivalence
- Porting the clean object I/O library to Haskell
- Premonoidal categories and notions of computation
- Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi
- Recursive monadic bindings
- Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell
- The revised report on the syntactic theories of sequential control and state
- Traced monoidal categories
- Traced Premonoidal Categories
Cited in
(7)- Shortcut fusion rules for the derivation of circular and higher-order programs
- Recursive monadic bindings
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
- The essence of expression refinement
- Traced Premonoidal Categories
- An abstract monadic semantics for value recursion
- scientific article; zbMATH DE number 1406087 (Why is no real title available?)
This page was built for publication: Semantics of value recursion for Monadic Input/Output
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787832)