Semantic Proof of Confluence of the Categorical Reduction System for Linear Logic

05/02/2021
by   Ryu Hasegawa, et al.
0

We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established. Namely, we obtain a method to determine if two morphisms are equal up to a certain equivalence.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/02/2019

A categorical reduction system for linear logic

We build calculus on the categorical model of linear logic. It enables u...
11/09/2017

A Proof of Stavi's Theorem

Kamp's theorem established the expressive equivalence of the temporal lo...
07/01/2020

Cartesian closed bicategories: type theory and coherence

In this thesis I lift the Curry–Howard–Lambek correspondence between the...
05/07/2021

Lovász-Type Theorems and Game Comonads

Lovász (1967) showed that two finite relational structures A and B are i...
12/30/2021

Flag: a Self-Dual Modality for Non-Commutative Contraction and Duplication in the Category of Coherence Spaces

After reminding what coherences spaces are and how they interpret linear...
08/03/2020

Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics

We characterize regular string transductions as programs in a linear λ-c...
10/15/2021

The Pebble-Relation Comonad in Finite Model Theory

The pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a...
This week in AI

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