scientific article; zbMATH DE number 431759
zbMATH Open0797.18004MaRDI QIDQ3138535FDOQ3138535
Authors: Stephen Brookes, Shai Geva 
Publication date: 11 October 1994
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 2001367
- scientific article; zbMATH DE number 1794706
- scientific article
- scientific article; zbMATH DE number 3893177
- Compositional conceptualization in intentional logics
- Natural language semantics and computability
- Intensionality, definability and computation
- Computational semantics in type theory
- scientific article; zbMATH DE number 4187780
- Compositionality, computability, and complexity
Kleisli categoryCartesian closedordered categoryintensional semanticscategories of algorithms on domainscomputation on domainscomputational comonadsexponentiation diagramextensional informationintensional categoryprogram denotations
Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20) Semantics in the theory of computing (68Q55)
Cited In (13)
- Lifting theorems for Kleisli categories
- Comonadic notions of computation
- Galois functors and entwining structures
- Concrete data structures and functional parallel programming
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
- Combining a monad and a comonad
- Relating structure and power: Comonadic semantics for computational resources
- Whither semantics?
- Title not available (Why is that?)
- Problems in rewriting applied to categorical concepts by the example of a computational comonad
- The costructure–cosemantics adjunction for comodels for computational effects
- Monad as modality
- Internal and Interval Semantics for CP-Comparatives
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138535)
