Stream processors and comodels
From MaRDI portal
Recommendations
Cites work
- Adjunction models for call-by-push-value with stacks
- Algebra valued functors in general and tensor products in particular
- Algebraic and coalgebraic perspectives on interaction laws
- Characterising behavioural equivalence: Three sides of one coin
- Combining effects: sum and tensor
- From comodels to coalgebras: state and arrays
- Generic Trace Semantics via Coinduction
- scientific article; zbMATH DE number 1497803 (Why is no real title available?)
- scientific article; zbMATH DE number 2087441 (Why is no real title available?)
- scientific article; zbMATH DE number 896973 (Why is no real title available?)
- scientific article; zbMATH DE number 3319584 (Why is no real title available?)
- Induced functors on categories of algebras
- Interaction laws of monads and comonads
- Linear usage of state
- Notions of computation and monads
- Program equivalence is coinductive
- Representable Functors and Operations on Rings
- Representations of stream processors using nested fixed points
- Runners in Action
- Sound and complete equational reasoning over comodels
- Stateful runners of effectful computations
- Tensors of comodels and models for operational semantics
- The costructure–cosemantics adjunction for comodels for computational effects
- Toward a uniform theory of effectful state machines
Cited in
(3)
This page was built for publication: Stream processors and comodels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883748)