The last rule of the derivation must bemany: (πi ▷Γ i, x:M i ⊢li t:L i)i∈I ⊎i∈I Γi, x:M⊢ P i∈I li t: [Li]i∈I many withM=⊎ i∈I Mi andk= P i∈I li and⊎ i∈I Γi =Γ

Multi types,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 46
Relational semantics refines the contextual preorder on lambda terms by constraining interaction counts through a checkers-calculus interpretation.