Adjoint Natural Deduction (Extended Version)
<|reference_start|>Adjoint Natural Deduction (Extended Version): Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has been defined in the form of a sequent calculus because the central concept of independence is most clearly understood in this form, and because it permits a proof of cut elimination following standard techniques.   In this paper we present a natural deduction formulation of adjoint logic and show how it is related to the sequent calculus. As a consequence, every provable proposition has a verification (sometimes called a long normal form). We also give a computational interpretation of adjoint logic in the form of a functional language and prove properties of computations that derive from the structure of modes, including freedom from garbage (for modes without weakening and contraction), strictness (for modes disallowing weakening), and erasure (based on a preorder between modes). Finally, we present a surprisingly subtle algorithm for type checking.<|reference_end|>
@article{jang2024adjoint,
    title={Adjoint Natural Deduction (Extended Version)},
    author={Junyoung Jang, Sophia Roshal, Frank Pfenning, and Brigitte Pientka},
    journal={arXiv preprint arXiv:2402.01428},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.01428},
    primaryClass={cs.LO cs.PL}
}