2026/07/18 by Philippe de Groote, Vincent Tourneur
Computer Science · #Logic, programming, and type systems #Formal Methods in Verification #Logic, Reasoning, and Knowledge
paper · pdf · doi:10.4204/eptcs.449.5
We introduce a typing system that is particularly well suited for typing the linear lambda-calculus in de Bruijn notation. This typing discipline, which is reminiscent of Hodas' and Miller's model of resource consumption, guarantees that any well-typed term is linear without the need for an occurrence check. We then establish the subject reduction property.