Then the last rule of the derivationπis@and is followed by theλrule on the left: Γ, x:M⊢ k1 s:L Γ⊢ k1 λc x.s:M c − →L∆⊢ k2 u:M Γ⊎∆⊢ k (λc x.s)· d u:L @ wherek=k 1 +k 2 +δ ⊥ c,d

(a)Root step,i

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

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.LO · 2026-01-04 · unverdicted · novelty 7.0

Relational semantics refines the contextual preorder on lambda terms by constraining interaction counts through a checkers-calculus interpretation.

Showing 1 of 1 citing paper.

Interaction Improvement cs.LO · 2026-01-04 · unverdicted · none · ref 51
Relational semantics refines the contextual preorder on lambda terms by constraining interaction counts through a checkers-calculus interpretation.