Title resolution pending

IfΘ |Γ⊢letx=∗yine0 :τ⇒Γ′, then there existΓ1, z, τy, r, τ′,τ′′, τx, andτ′ y such that (1)Γ ≤Γ1, (2)Γ 1(y) = Πz

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.

representative citing papers

Ownership Refinement Types for Pointer Arithmetic and Nested Arrays

cs.PL · 2026-04-24 · conditional · novelty 5.0

Generalizing ownership in refinement types to reference outer array indices enables sound verification of nested array programs.

citing papers explorer

Showing 1 of 1 citing paper after filters.

Ownership Refinement Types for Pointer Arithmetic and Nested Arrays cs.PL · 2026-04-24 · conditional · none · ref 18
Generalizing ownership in refinement types to reference outer array indices enables sound verification of nested array programs.

Title resolution pending

fields

years

verdicts

representative citing papers

citing papers explorer