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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Relational semantics refines the contextual preorder on lambda terms by constraining interaction counts through a checkers-calculus interpretation.
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.
-
Interaction Improvement
Relational semantics refines the contextual preorder on lambda terms by constraining interaction counts through a checkers-calculus interpretation.