BibTex format
@unpublished{Bernardy:2022,
author = {Bernardy, J-P and Eisenberg, R and Kiss, C and Spiwack, A and Wu, N},
title = {Linear Constraints},
url = {http://arxiv.org/abs/2103.06127v1},
year = {2022}
}
Publications
Citation
RIS format (EndNote, RefMan)
TY - UNPB
AB - A linear argument must be consumed exactly once in the body of its function.A linear type system can verify the correct usage of resources such as filehandles and manually managed memory. But this verification requiresbureaucracy. This paper presents linear constraints, a front-end feature forlinear typing that decreases the bureaucracy of working with linear types.Linear constraints are implicit linear arguments that are to be filled inautomatically by the compiler. Linear constraints are presented as a qualifiedtype system, together with an inference algorithm which extends OutsideIn,GHC's existing constraint solver algorithm. Soundness of linear constraints isensured by the fact that they desugar into Linear Haskell.
AU - Bernardy,J-P
AU - Eisenberg,R
AU - Kiss,C
AU - Spiwack,A
AU - Wu,N
PY - 2022///
TI - Linear Constraints
UR - http://arxiv.org/abs/2103.06127v1
UR - http://hdl.handle.net/10044/1/90449
ER -