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

page 1

page 2

page 3

page 4

research
12/14/2022

Category-Graded Algebraic Theories and Effect Handlers

We provide an effect system CatEff based on a category-graded extension ...
research
07/20/2017

A monadic solution to the Cartwright-Felleisen-Wadler conjecture

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

Unifying graded and parameterised monads

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

Polymorphic Iterable Sequential Effect Systems

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

Cartesian bicategories with choice

Relational structures are emerging as ubiquitous mathematical machinery ...
research
03/30/2020

Bisimulation as a Logical Relation

We investigate how various forms of bisimulation can be characterised us...
research
04/14/2019

No Adjective Ordering Mystery, and No Raven Paradox, Just an Ontological Mishap

In the concluding remarks of Ontological Promiscuity Hobbs (1985) made w...

Please sign up or login with your details

Forgot password? Click here to reset