Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics

04/10/2018
by   Ohad Kammar, et al.
0

Type-and-effect systems incorporate information about the computational effects, e.g., state mutation, probabilistic choice, or I/O, a program phrase may invoke alongside its return value. A semantics for type-and-effect systems involves a parameterised family of monads whose size is exponential in the number of effects. We derive such refined semantics from a single monad over a category, a choice of algebraic operations for this monad, and a suitable factorisation system over this category. We relate the derived semantics to the original semantics using fibrations for logical relations. Our proof uses a folklore technique for lifting monads with operations.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/25/2017

Logical relations for coherence of effect subtyping

A coercion semantics of a programming language with subtyping is typical...
07/20/2017

A monadic solution to the Cartwright-Felleisen-Wadler conjecture

Given a programming language, can we give a monadic denotational semanti...
01/28/2020

Unifying graded and parameterised monads

Monads are a useful tool for structuring effectful features of computati...
08/06/2018

Polymorphic Iterable Sequential Effect Systems

Effect systems are lightweight extensions to type systems that can verif...
03/20/2020

Cartesian bicategories with choice

Relational structures are emerging as ubiquitous mathematical machinery ...
06/23/2021

Native Implementation of Mutable Value Semantics

Unrestricted mutation of shared state is a source of many well-known pro...
03/30/2020

Bisimulation as a Logical Relation

We investigate how various forms of bisimulation can be characterised us...
This week in AI

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