Process algebra
Journal of the ACM (JACM)
On the greatest fixed point of a set functor
Theoretical Computer Science
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
On the structure of categories of coalgebras
Theoretical Computer Science
Combining a monad and a comonad
Theoretical Computer Science
Bialgebraic Modelling of Timed Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Initial Algebra and Final Coalgebra Semantics for Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
A unified category theoretic approach to variable binding
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Modularity of Behaviours for Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic semantics for timed processes
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Abstract Syntax: Substitution and Binders
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic Methods in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Coalgebraic semantics for timed processes
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Typed category theory-based micro-view emergency knowledge representation
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Structural operational semantics for weighted transition systems
Semantics and algebraic specification
Structural Operational Semantics and Modal Logic, Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Categorial semantics of a solution to distributed dining philosophers problem
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Pointwise extensions of gsos-defined operations
Mathematical Structures in Computer Science
The microcosm principle and compositionality of GSOS-based component calculi
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
CIA structures and the semantics of recursion
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
Comodels and effects in mathematical operational semantics
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We use the concept of a distributive law of a monad over a copointed endofunctor to define and develop a reformulation and mild generalisation of Turi and Plotkin's notion of an abstract operational rule. We make our abstract definition and give a precise analysis of the relationship between it and Turi and Plotkin's definition. Following Tuff and Plotkin, our definition, suitably restricted, agrees with the notion of a set of GSOS-rules, allowing one to construct both an operational model and a canonical, internally fully abstract denotational model. Going beyond Turi and Plotkin, we construct what might be seen as large-step operational semantics from small-step operational semantics and we show how our definition allows one to combine distributive laws, in particular accounting for the combination of operational semantics with congruences.