Modules over monads and operational semantics

12/11/2020
by   André Hirschowitz, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/25/2019

A Calculus for Language Transformations

In this paper we propose a calculus for expressing algorithms for progra...
07/05/2018

Rule Formats for Nominal Process Calculi

The nominal transition systems (NTSs) of Parrow et al. describe the oper...
08/29/2019

Cellular Monads from Positive GSOS Specifications

We give a leisurely introduction to our abstract framework for operation...
11/26/2020

Universal Semantics for the Stochastic Lambda-Calculus

We define sound and adequate denotational and operational semantics for ...
05/06/2021

Analytical Differential Calculus with Integration

Differential lambda-calculus was first introduced by Thomas Ehrhard and ...
08/09/2022

Lang-n-Send Extended: Sending Regular Expressions to Monitors

In prior work, Cimini has presented Lang-n-Send, a pi-calculus with lang...
11/14/2019

Reduction Monads and Their Signatures

In this work, we study 'reduction monads', which are essentially the sam...

Please sign up or login with your details

Forgot password? Click here to reset