A logical account of subtyping for session types

We study iso-recursive and equi-recursive subtyping for session types in a logical setting, where session types are propositions of multiplicative/additive linear logic extended with least and greatest fixed points. Both subtyping relations admit a simple characterization that can be roughly spelled...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 141; p. 100986
Main Authors Horne, Ross, Padovani, Luca
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.10.2024
Subjects
Fixed points
Linear logic
Session types
Subtyping
Termination
Linear logic
Fixed points
Termination
Session types
Subtyping
Online AccessGet full text

Cover

More Information
Summary:We study iso-recursive and equi-recursive subtyping for session types in a logical setting, where session types are propositions of multiplicative/additive linear logic extended with least and greatest fixed points. Both subtyping relations admit a simple characterization that can be roughly spelled out as the following lapalissade: every session type is larger than the smallest session type and smaller than the largest session type. We observe that, because of the logical setting in which they arise, these subtyping relations preserve termination in addition to the usual safety properties of sessions.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2024.100986