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
POST COMMENT

Comments

There are no comments yet.

Authors

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 ...
01/20/2020

Modular coinduction up-to for higher-order languages via first-order transition systems

The bisimulation proof method can be enhanced by employing `bisimulation...
01/26/2022

A Dependent Dependency Calculus (Extended Version)

Over twenty years ago, Abadi et al. established the Dependency Core Calc...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.