Modules over monads and operational semantics (expanded version)ArticleAuthors: André Hirschowitz ; Tom Hirschowitz

; Ambroise Lafont
NULL##0000-0002-7220-4067##NULL
André Hirschowitz;Tom Hirschowitz;Ambroise Lafont
This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce transition monads, thus covering new applications such as lambda-bar-mu-calculus, pi-calculus, Positive GSOS specifications, differential lambda-calculus, and the big-step, simply-typed, call-by-value lambda-calculus.
Moreover, we design a suitable notion of signature for transition monads.
Volume: Volume 18, Issue 3
Secondary volumes: Selected Papers of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)
Published on: August 2, 2022
Accepted on: April 5, 2022
Submitted on: December 14, 2020
Keywords: Computer Science - Programming Languages, Computer Science - Logic in Computer Science, Mathematics - Category Theory, 68N15, D.3.1, F.3.2