research
∙
11/13/2022
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq
This paper introduces Choice Trees (ctrees), a monad for modeling nondet...
share
research
∙
01/08/2020
An Equational Theory for Weak Bisimulation via Generalized Parameterized Coinduction
Coinductive reasoning about infinitary structures such as streams is wid...
research
∙
05/31/2019
Interaction Trees: Representing Recursive and Impure Programs in Coq (Work In Progress)
We present "interaction trees" (ITrees), a general-purpose data structur...
research
∙
02/02/2018
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability
The study of word equations (or the existential theory of equations over...
research
∙
06/12/2017
