A Typing System for the Linear Lambda-Calculus in de Bruijn Notation
arXiv:2607.20181 · doi:10.4204/EPTCS.449.5
Abstract
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.
In Proceedings LSFA 2026, arXiv:2607.15904