69 citations · 106 across the 6 of their papers we have counts for
6 papers
Algebraic Reasoning About Timeliness
Seyed Hossein Haeri, Peter W. Thompson, Peter Van Roy +5
Designing distributed systems to have predictable performance under high load is difficult because of resource exhaustion, non-linearity, and stochastic behaviour. Timeliness, i.e.…
A Type and Scope Safe Universe of Syntaxes with Binding: Their Semantics and Proofs
Guillaume Allais, Robert Atkey, James Chapman +2
Almost every programming language's syntax includes a notion of binder and corresponding bound occurrences, along with the accompanying notions of -equivalence, capture-avoiding…
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…
Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types
Andreas Abel, James Chapman
In this paper, we present an Agda formalization of a normalizer for simply-typed lambda terms. The normalizer consists of two coinductively defined functions in the delay monad: On…
Proceedings Fourth Workshop on Mathematically Structured Functional Programming
James Chapman, Paul Blain Levy
This volume contains the proceedings of the Fourth Workshop on Mathematically Structured Functional Programming (MSFP 2012), taking place on 25 March, 2012 in Tallinn, Estonia, as…