Modules over monads and operational semantics (expanded version)

André Hirschowitz (1) , Tom Hirschowitz (2) , Tom Hirschowitz (3)

1 UniCA - Université Côte d'Azur
2 LAMA - Laboratoire de Mathématiques
3 UNSW - University of New South Wales [Sydney]

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.

Domaines: Logique en informatique [cs.LO]; Langage de programmation [cs.PL]

André Hirschowitz, Tom Hirschowitz, Tom Hirschowitz. Modules over monads and operational semantics (expanded version). Logical Methods in Computer Science, 2022, 18 (3). ⟨hal-03447952v2⟩