69 citations · 205 across the 22 of their papers we have counts for
4 papers · 1 filter
Generating Representative Executions [Extended Abstract]
Hendrik Maarand, Tarmo Uustalu
Analyzing the behaviour of a concurrent program is made difficult by the number of possible executions. This problem can be alleviated by applying the theory of Mazurkiewicz traces…
Monads need not be endofunctors
Thosten Altenkirch, James Chapman, Tarmo Uustalu
We introduce a generalization of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, u…
When is a container a comonad?
Danel Ahman, James Chapman, Tarmo Uustalu
Abbott, Altenkirch, Ghani and others have taught us that many parameterized datatypes (set functors) can be usefully analyzed via container representations in terms of a set of sha…
Coinductive Big-Step Semantics for Concurrency
Tarmo Uustalu
In a paper presented at SOS 2010, we developed a framework for big-step semantics for interactive input-output in combination with divergence, based on coinductive and mixed induct…