Weak-Linear Types

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Gramaglia, Hector
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912633790136320
author Gramaglia, Hector
author_facet Gramaglia, Hector
contents Computational interpretations of linear logic allow static control of memory resources: the data produced by the program are endowed through its type with attributes that determine its life cycle, and guarantee safe deallocation. The use of linear types encounters limitations in practice, since linear data, in the traditional sense, do not so often appear in actual programs. Several alternatives have been proposed in the attempt to relax the condition of linearity, adding coercions to the language to allow linear objects to be temporarily aliased. In this work we propose a new alternative, whose virtue is to preserve the simplicity and elegance of the original system.
format Preprint
id arxiv_https___arxiv_org_abs_2402_12108
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Weak-Linear Types
Gramaglia, Hector
Programming Languages
F.3.2; F.3.3; D.3.3
Computational interpretations of linear logic allow static control of memory resources: the data produced by the program are endowed through its type with attributes that determine its life cycle, and guarantee safe deallocation. The use of linear types encounters limitations in practice, since linear data, in the traditional sense, do not so often appear in actual programs. Several alternatives have been proposed in the attempt to relax the condition of linearity, adding coercions to the language to allow linear objects to be temporarily aliased. In this work we propose a new alternative, whose virtue is to preserve the simplicity and elegance of the original system.
title Weak-Linear Types
topic Programming Languages
F.3.2; F.3.3; D.3.3
url https://arxiv.org/abs/2402.12108