``Keep definition, change category -- a practical approach to state-based system calculi

DOI10.1016/j.jlamp.2015.11.007zbMath1344.68150OpenAlexW2242936154MaRDI QIDQ299180

José Nuno Oliveira, Victor Cacciari Miraldo

Publication date: 22 June 2016

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.11.007

zbMATH Keywords

relation algebralinear algebraMealy automataKleisli categorysoftware calculi

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (2)

Gaussian elimination is not optimal, revisited ⋮ Probabilistic mediator: a coalgebraic perspective

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A coalgebraic perspective on linear weighted automata
• Probabilistic systems coalgebraically: a survey
• Transposing partial components--an exercise on coalgebraic refinement
• New structures for physics
• Generalising monads to arrows
• Universal coalgebra: A theory of systems
• Towards a linear algebra of programming
• Trace semantics via determinization
• A linear algebra approach to OLAP
• Combining effects: sum and tensor
• Monads on symmetric monoidal closed categories
• Strong functors and monoidal monads
• Coalgebraic Components in a Many-Sorted Microcosm
• Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory
• Categories for the Practising Physicist
• Exercises in Quantifier Manipulation
• Relational Methods in Computer Science
• Abstraction, Refinement and Proof for Probabilistic Systems
• WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES
• Developments in Concurrent Kleene Algebra
• Preparing Relational Algebra for “Just Good Enough” Hardware
• Generic Trace Semantics via Coinduction
• FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
• Generic Forward and Backward Simulations
• Lifting theorems for Kleisli categories

This page was built for publication: ``Keep definition, change category -- a practical approach to state-based system calculi