Semantics for algebraic operations
From MaRDI portal
Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Categorical semantics of formal languages (18C50) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Recommendations
Cites work
- A Powerdomain Construction
- A representable approach to finite nondeterminism
- scientific article; zbMATH DE number 1705158 (Why is no real title available?)
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 3751225 (Why is no real title available?)
- scientific article; zbMATH DE number 1330454 (Why is no real title available?)
- scientific article; zbMATH DE number 1373521 (Why is no real title available?)
- Notions of computation and monads
Cited in
(29)- Operational and denotational semantics for the box algebra
- Algebraic operations and generic effects
- Modular structural operational semantics
- Complete axiomatization for the total variation distance of Markov chains
- Weakest preconditions in fibrations
- A divertimento on MonadPlus and nondeterminism
- Lawvere theories enriched over a general base
- Combining effects: sum and tensor
- scientific article; zbMATH DE number 1705158 (Why is no real title available?)
- Dependent types and fibred computational effects
- Comonadic notions of computation
- Relating Computational Effects by ⊤ ⊤-Lifting
- A coinductive calculus for asynchronous side-effecting processes
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- Models for the computational \(\lambda\)-calculus
- Runners in Action
- Weakest preconditions in fibrations
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- Finitary monads on the category of posets
- Doo bee doo bee doo
- Unguarded recursion on coinductive resumptions
- Monad transformers as monoid transformers
- Modal crash types for intermittent computing
- Sum and tensor of quantitative effects
- A general completeness theorem for skip-free star algebras
- Effectful semantics in bicategories: strong, commutative, and concurrent pseudomonads
- Algebraic effects and handlers for arrows
- About permutation algebras, (pre)sheaves and named sets
- Generic models for computational effects
This page was built for publication: Semantics for algebraic operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917064)
