Linear constraints act as compiler-filled implicit linear arguments in a qualified type system extending GHC's solver, with soundness via desugaring to Linear Haskell.
We conclude by definition ofQ 1 ∧Q 2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Linear Constraints
Linear constraints act as compiler-filled implicit linear arguments in a qualified type system extending GHC's solver, with soundness via desugaring to Linear Haskell.