AI Chat

Modules over monads and operational semantics

12/11/2020

∙

by André Hirschowitz, et al.

∙

∙

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.

André Hirschowitz
4 publications
Tom Hirschowitz
9 publications
Ambroise Lafont
10 publications

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...

0 Benjamin Mourad, et al. ∙

∙ 07/05/2018

Rule Formats for Nominal Process Calculi

The nominal transition systems (NTSs) of Parrow et al. describe the oper...

0 Luca Aceto, et al. ∙

∙ 08/29/2019

Cellular Monads from Positive GSOS Specifications

We give a leisurely introduction to our abstract framework for operation...

0 Tom Hirschowitz, et al. ∙

∙ 11/26/2020

Universal Semantics for the Stochastic Lambda-Calculus

We define sound and adequate denotational and operational semantics for ...

0 Pedro Amorim, et al. ∙

∙ 05/06/2021

Analytical Differential Calculus with Integration

Differential lambda-calculus was first introduced by Thomas Ehrhard and ...

0 Han Xu, et al. ∙

∙ 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...

0 Matteo Cimini, et al. ∙

∙ 11/14/2019

Reduction Monads and Their Signatures

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

0 Benedikt Ahrens, et al. ∙