A categorical reduction system for linear logic

12/02/2019
by   Ryu Hasegawa, et al.
0

We build calculus on the categorical model of linear logic. It enables us to perform diagram chasing as essentially one-way computations led by rewriting rules. We verify the termination property of the calculus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2021

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

We verify a confluence result for the rewriting calculus of the linear c...
research
11/03/2020

Palette diagram: A Python package for visualization of collective categorical data

Categorical data, wherein a numerical quantity is assigned to each categ...
research
04/15/2019

On the Lambek Calculus with an Exchange Modality

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic)...
research
12/16/2019

On the Unity of Logic: a Sequential, Unpolarized Approach

The present work aims to give a unity of logic via standard sequential, ...
research
12/14/2018

Graphical Regular Logic

Regular logic can be regarded as the internal language of regular catego...
research
07/08/2022

An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus

Fair termination is the property of programs that may diverge "in princi...
research
04/14/2022

The Forms of Categorical Proposition

An exhaustive survey of categorical propositions is proposed in the pres...

Please sign up or login with your details

Forgot password? Click here to reset