Executable Denotational Semantics with Interaction Trees

Interaction trees are a representation of effectful and reactive systemsdesigned to be implemented in a proof assistant such as Coq.They are equipped with a rich algebra of combinators to construct recursiveand effectful computations and to reason about them equationally.Interaction trees are also an executable structure, notably via extraction,which enables testing and directly developing executable programs in Coq.To demonstrate the usefulness of interaction trees, two applications arepresented. First, I develop a novel approach to verify a compiler from a simpleimperative language to assembly, by proving a semantic preservation theoremwhich is termination-sensitive, using an equational proof. Second, I present aframework of concurrent objects, inheriting the modularity, compositionality,and executability of interaction trees. Leveraging that framework,I formally prove the correctness of a transactionally predicated map, using anovel approach to reason about objects combining the notions of linearizabilityand strict serializability, two well-known correctness conditions forconcurrent objects