Parameterised notions of computation
From MaRDI portal
Publication:3638920
DOI10.1017/S095679680900728XzbMath1191.68156MaRDI QIDQ3638920
Publication date: 28 October 2009
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items (16)
Algebras for Parameterised Monads ⋮ Relating Functional and Imperative Session Types ⋮ A unified framework for notions of algebraic theory ⋮ Higher-order Algebras and Coalgebras from Parameterized Endofunctors ⋮ More dependent types for distributed arrays ⋮ ElixirST: a session-based type system for elixir modules ⋮ Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language ⋮ A representation theorem for second-order functionals ⋮ Flexible dynamic information flow control in the presence of exceptions ⋮ The Cooper storage idiom ⋮ Unnamed Item ⋮ Unifying Guarded and Unguarded Iteration ⋮ Graded Hoare logic and its categorical semantics ⋮ Roles, stacks, histories: A triple for Hoare ⋮ A Coq Library for Internal Verification of Running-Times ⋮ The parametric continuation monad
Cites Work
- Linear logic
- From CML to its process algebra
- Notions of computation and monads
- Type checking a multithreaded functional language with session types
- Modelling environments in call-by-value programming languages.
- Uniqueness logic
- Separation and information hiding
- Premonoidal categories and notions of computation
- The marriage of effects and monads
- Polymorphism and separation in hoare type theory
- Unnamed Item
This page was built for publication: Parameterised notions of computation
