PaJAM generalizes JAM/IAM/PAM via backtracking depth and extracts its step count from non-idempotent intersection type derivations, yielding a polynomial reasonable cost model for bounded depth.
Title resolution pending
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Jumps, Interactions, and Intersection Types
PaJAM generalizes JAM/IAM/PAM via backtracking depth and extracts its step count from non-idempotent intersection type derivations, yielding a polynomial reasonable cost model for bounded depth.