pith. sign in

Title resolution pending

⊗1·q By induction hypothesis, Q′ 1 ∧Q ′ 2 ⊩Q ′ 1, Q′ 1 ∧Q ′ 2 ⊩Q ′

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.PL 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Linear Constraints

cs.PL · 2026-04-23 · unverdicted · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Linear Constraints cs.PL · 2026-04-23 · unverdicted · none · ref 2

    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.