Parameterised notions of computation
From MaRDI portal
Recommendations
Cites work
- From CML to its process algebra
- scientific article; zbMATH DE number 1289305 (Why is no real title available?)
- Linear logic
- Modelling environments in call-by-value programming languages.
- Notions of computation and monads
- Polymorphism and separation in Hoare type theory
- Premonoidal categories and notions of computation
- Separation and information hiding
- The marriage of effects and monads
- Type checking a multithreaded functional language with session types
- Uniqueness logic
Cited in
(21)- The Cooper storage idiom
- More dependent types for distributed arrays
- Graded Hoare logic and its categorical semantics
- A Coq library for internal verification of running-times
- Algebras for parameterised monads
- Higher-order algebras and coalgebras from parameterized endofunctors
- Unifying guarded and unguarded iteration
- Roles, stacks, histories: a triple for Hoare
- A unified framework for notions of algebraic theory
- Unifying graded and parameterised monads
- Relating Functional and Imperative Session Types
- The parametric continuation monad
- A representation theorem for second-order functionals
- Flexible dynamic information flow control in the presence of exceptions
- Parametric effect monads and semantics of effect systems
- Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
- Cartesian effect categories are Freyd-categories
- Type-safe quantum programming in Idris
- A monadic formalization of ML5
- Quantum relaxations of CSP and structure isomorphism
- Generic models for computational effects
This page was built for publication: Parameterised notions of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638920)
