Relational semantics refines the contextual preorder on lambda terms by constraining interaction counts through a checkers-calculus interpretation.
This implies that there are d1, d2 such that d = d1 + d2 + δ⊥ c,c′ and ⟨Γ ′ 1, L′⟩ ≤ + d1 ⟨Γ1, L⟩ and Interaction Improvement 43 M′ ≤− d2 M
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Interaction Improvement
Relational semantics refines the contextual preorder on lambda terms by constraining interaction counts through a checkers-calculus interpretation.