Steps and Traces

04/11/2020
by   Jurriaan Rot, et al.
0

In the theory of coalgebras, trace semantics can be defined in various distinct ways, including through algebraic logics, the Kleisli category of a monad or its Eilenberg-Moore category. This paper elaborates two new unifying ideas: 1) coalgebraic trace semantics is naturally presented in terms of corecursive algebras, and 2) all three approaches arise as instances of the same abstract setting. Our perspective puts the different approaches under a common roof, and allows to derive conditions under which some of them coincide.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/08/2019

A General Framework for the Semantics of Type Theory

We propose an abstract notion of a type theory to unify the semantics of...
02/25/2018

Trace semantics via determinization for probabilistic transition systems

A coalgebraic definition of finite and infinite trace semantics for prob...
03/04/2019

Differentiable Causal Computations via Delayed Trace

We investigate causal computations taking sequences of inputs to sequenc...
08/02/2018

Trace Semantics for Nondeterministic Probabilistic Automata via Determinization

This paper studies trace-based equivalences for automata combining nonde...
08/27/2018

Trace and Testing Metrics on Nondeterministic Probabilistic Processes

The combination of nondeterminism and probability in concurrent systems ...
01/28/2020

Unifying graded and parameterised monads

Monads are a useful tool for structuring effectful features of computati...
12/29/2017

Unifying Theories of Time with Generalised Reactive Processes

Hoare and He's theory of reactive processes provides a unifying foundati...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.