Notions of computation and monads
Information and Computation
Monad transformers and modular interpreters
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
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
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
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th 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
A poor man's concurrency monad
Journal of Functional Programming
Monad-independent Dynamic Logic in HasCasl
Journal of Logic and Computation
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Combining algebraic effects with continuations
Theoretical Computer Science
On the relations between monadic semantics
Theoretical Computer Science
Free-algebra models for the π -calculus
Theoretical Computer Science
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Achieving information flow security through monadic control of effects
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Kleene monads: handling iteration in a framework of generic effects
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
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)
A coinductive calculus for asynchronous side-effecting processes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
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 meta-language of effects. We establish soundness and completeness of a natural equational axiomatization of this calculus. Our main result is 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. Moreover, we present initial results on verification methods for generic side-effecting processes.