Work

Soft Session Types

Year: 2011

Type: article

Abstract: We show how systems of session types can enforce interactions to be bounded for all typable processes. The type system we propose is based on Lafont's soft linear logic and is strongly inspired by recent works about session types as intuitionistic linear logic formulas. Our main result is the existence, for every typable process, of a polynomial bound on the length of any reduction sequence starting from it and on the size of any of its reducts.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.64.5

Authors: Ugo Dal Lago, Paolo Di Giamberardino

Institutions: Institut national de recherche en sciences et technologies du numérique, University of Bologna, Laboratoire d'Informatique de Paris-Nord

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2013107896

FWCI: 1.769

Cites: 15

Cited by: 9

Related to: 10