Notions of computation and monads
Information and Computation
ACM Computing Surveys (CSUR)
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Concurrency verification: introduction to compositional and noncompositional methods
Concurrency verification: introduction to compositional and noncompositional methods
Communication and Concurrency
Coalgebras and monads in the semantics of java
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
Testing Equivalence for Processes
Proceedings of the 10th Colloquium on Automata, Languages and Programming
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Categories of Processes Enriched in Final Coalgebras
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
A fully abstract model for the π-calculus
Information and Computation
Mathematical Structures in Computer Science
A study of evaluation order semantics in expressions with side effects
Journal of Functional Programming
Monad-independent Dynamic Logic in HasCasl
Journal of Logic and Computation
On the relations between monadic semantics
Theoretical Computer Science
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
Achieving information flow security through monadic control of effects
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Complete iterativity for algebras with effects
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
From Coalgebraic to Monoidal Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Operational semantics using the partiality monad
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
The confinement problem in the presence of faults
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
A coinductive calculus for asynchronous side-effecting processes
Information and Computation
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We present an abstract framework for concurrent processes in which atomic steps have generic side effects, handled according to the principle of monadic encapsulation of effects. Processes in this framework are potentially infinite resumptions, modelled using final coalgebras over the monadic base. As a calculus for such processes, we introduce a concurrent extension of Moggi's monadic metalanguage of effects. We establish soundness and completeness of a natural equational axiomatisation of this calculus. Moreover, we identify a corecursion scheme that is explicitly definable over the base language and provides flexible expressive means for the definition of new operators on processes, such as parallel composition. As a worked example, we prove the safety of a generic mutual exclusion scheme using a verification logic built on top of the equational calculus.