<bibliography>
 <citation type="article" key="AACMM20">
  <author>Guillaume <surname>Allais</surname></author>
  <author>Robert <surname>Atkey</surname></author>
  <author>James <surname>Chapman</surname></author>
  <author>Conor <surname>McBride</surname></author>
  <author>James <surname>McKinna</surname></author>
  <year>2021</year>
  <title>A type- and scope-safe universe of syntaxes with binding: their semantics and proofs</title>
  <journal>Journal of Functional Programming</journal>
  <volume>31</volume>
  <pages>e22</pages>
  <doi>10.1017/S0956796820000076</doi>
 </citation>
 <citation type="article" key="AbelBernardy2020">
  <author>Andreas <surname>Abel</surname></author>
  <author>Jean-Philippe <surname>Bernardy</surname></author>
  <year>2020</year>
  <title>A Unified View of Modalities in Type Systems</title>
  <journal>Proc. ACM Program. Lang.</journal>
  <volume>4</volume>
  <number>ICFP</number>
  <doi>10.1145/3408972</doi>
 </citation>
 <citation type="inproceedings" key="allais:LIPIcs:2018:10049">
  <author>Guillaume <surname>Allais</surname></author>
  <year>2018</year>
  <title>Typing with Leftovers - A mechanization of Intuitionistic Multiplicative-Additive Linear Logic</title>
  <booktitle>TYPES 2017</booktitle>
  <pages>1:1&#8211;1:22</pages>
  <doi>10.4230/LIPIcs.TYPES.2017.1</doi>
 </citation>
 <citation type="techreport" key="Barber1996">
  <author>Andrew <surname>Barber</surname></author>
  <year>1996</year>
  <title>Dual Intuitionistic Linear Logic</title>
  <type>Technical Report</type>
  <institution>University of Edinburgh</institution>
 </citation>
 <citation type="inproceedings" key="BentonBPH93">
  <author>P. N. <surname>Benton</surname></author>
  <author>Gavin M. <surname>Bierman</surname></author>
  <author>Valeria <surname>de Paiva</surname></author>
  <author>Martin <surname>Hyland</surname></author>
  <year>1993</year>
  <title>A Term Calculus for Intuitionistic Linear Logic</title>
  <booktitle>Typed Lambda Calculi and Applications</booktitle>
  <series>LNCS</series>
  <volume>664</volume>
  <publisher>Springer</publisher>
  <pages>75&#8211;90</pages>
  <doi>10.1007/BFb0037099</doi>
 </citation>
 <citation type="inproceedings" key="BrunelGMZ14">
  <author>Alo&#239;s <surname>Brunel</surname></author>
  <author>Marco <surname>Gaboardi</surname></author>
  <author>Damiano <surname>Mazza</surname></author>
  <author>Steve <surname>Zdancewic</surname></author>
  <year>2014</year>
  <title>A Core Quantitative Coeffect Calculus</title>
  <editor>Zhong <surname>Shao</surname></editor>
  <booktitle>Programming Languages and Systems - 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>8410</volume>
  <publisher>Springer</publisher>
  <pages>351&#8211;370</pages>
  <doi>10.1007/978-3-642-54833-8_19</doi>
 </citation>
 <citation type="article" key="bhkm12">
  <author>Nick <surname>Benton</surname></author>
  <author>Chung-Kil <surname>Hur</surname></author>
  <author>Andrew <surname>Kennedy</surname></author>
  <author>Conor <surname>McBride</surname></author>
  <year>2012</year>
  <title>Strongly typed term representations in Coq</title>
  <journal>J. of Autom Reasoning</journal>
  <volume>49</volume>
  <number>2</number>
  <doi>10.1007/s10817-011-9219-0</doi>
 </citation>
 <citation type="article" key="ChaudhuriLR19">
  <author>Kaustuv <surname>Chaudhuri</surname></author>
  <author>Leonardo <surname>Lima</surname></author>
  <author>Giselle <surname>Reis</surname></author>
  <year>2019</year>
  <title>Formalized meta-theory of sequent calculi for linear logics</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>781</volume>
  <pages>24&#8211;38</pages>
  <doi>10.1016/j.tcs.2019.02.023</doi>
 </citation>
 <citation type="article" key="crary10">
  <author>Karl <surname>Crary</surname></author>
  <year>2010</year>
  <title>Higher-Order Representation of Substructural Logics</title>
  <journal>SIGPLAN Not.</journal>
  <volume>45</volume>
  <number>9</number>
  <pages>131142</pages>
  <doi>10.1145/1932681.1863565</doi>
 </citation>
 <citation type="inproceedings" key="GhicaS14">
  <author>Dan R. <surname>Ghica</surname></author>
  <author>Alex I. <surname>Smith</surname></author>
  <year>2014</year>
  <title>Bounded Linear Types in a Resource Semiring</title>
  <editor>Zhong <surname>Shao</surname></editor>
  <booktitle>Programming Languages and Systems - 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>8410</volume>
  <publisher>Springer</publisher>
  <pages>331&#8211;350</pages>
  <doi>10.1007/978-3-642-54833-8_18</doi>
 </citation>
 <citation type="unpublished" key="laurent18">
  <author>Olivier <surname>Laurent</surname></author>
  <year>2018</year>
  <title>Preliminary Report on the Yalla Library</title>
  <url>https://perso.ens-lyon.fr/olivier.laurent/yalla/</url>
  <note>Coq Workshop</note>
 </citation>
 <citation type="inproceedings" key="LicataSR17">
  <author>Daniel R. <surname>Licata</surname></author>
  <author>Michael <surname>Shulman</surname></author>
  <author>Mitchell <surname>Riley</surname></author>
  <year>2017</year>
  <title>A Fibrational Framework for Substructural and Modal Logics</title>
  <booktitle>FSCD 2017</booktitle>
  <pages>25:1&#8211;25:22</pages>
  <doi>10.4230/LIPIcs.FSCD.2017.25</doi>
 </citation>
 <citation type="misc" key="rensub05">
  <author>Conor <surname>McBride</surname></author>
  <year>2005</year>
  <title>Type-preserving renaming and substitution</title>
  <url>http://www.strictlypositive.org/ren-sub.pdf</url>
 </citation>
 <citation type="article" key="Granule18">
  <author>Dominic <surname>Orchard</surname></author>
  <author>Vilem-Benjamin <surname>Liepelt</surname></author>
  <author>Harley Eades <surname>III</surname></author>
  <year>2019</year>
  <title>Quantitative program reasoning with graded modal types</title>
  <journal>Proc. ACM Program. Lang.</journal>
  <volume>3</volume>
  <number>ICFP</number>
  <pages>110:1&#8211;110:30</pages>
  <doi>10.1145/3341714</doi>
 </citation>
 <citation type="inproceedings" key="judgmental">
  <author>Frank <surname>Pfenning</surname></author>
  <author>Rowan <surname>Davies</surname></author>
  <year>2001</year>
  <title>A judgmental reconstruction of modal logic</title>
  <volume>11</volume>
  <pages>511&#8211;540</pages>
  <doi>10.1017/S0960129501003322</doi>
 </citation>
 <citation type="inproceedings" key="PetricekOM14">
  <author>Tomas <surname>Petricek</surname></author>
  <author>Dominic A. <surname>Orchard</surname></author>
  <author>Alan <surname>Mycroft</surname></author>
  <year>2014</year>
  <title>Coeffects: a calculus of context-dependent computation</title>
  <editor>Johan <surname>Jeuring</surname></editor>
  <editor>Manuel M. T. <surname>Chakravarty</surname></editor>
  <booktitle>Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, Gothenburg, Sweden, September 1-3, 2014</booktitle>
  <publisher>ACM</publisher>
  <pages>123&#8211;135</pages>
  <doi>10.1145/2628136.2628160</doi>
 </citation>
 <citation type="unpublished" key="power99">
  <author>James <surname>Power</surname></author>
  <author>Caroline <surname>Webster</surname></author>
  <year>1999</year>
  <title>Working with Linear Logic in Coq</title>
  <note>12th International Conference on Theorem Proving in Higher Order Logics (Work-in-progress paper)</note>
 </citation>
 <citation type="inproceedings" key="RPKV20">
  <author>Arjen <surname>Rouvoet</surname></author>
  <author>Casper <surname>Bach Poulsen</surname></author>
  <author>Robbert <surname>Krebbers</surname></author>
  <author>Eelco <surname>Visser</surname></author>
  <year>2020</year>
  <title>Intrinsically-Typed Definitional Interpreters for Linear, Session-Typed Languages</title>
  <booktitle>CPP 2020</booktitle>
  <pages>284&#8211;298</pages>
  <doi>10.1145/3372885.3373818</doi>
 </citation>
 <citation type="inproceedings" key="reed10distance">
  <author>Jason <surname>Reed</surname></author>
  <author>Benjamin C. <surname>Pierce</surname></author>
  <year>2010</year>
  <title>Distance makes the types grow stronger: a calculus for differential privacy</title>
  <editor>Paul <surname>Hudak</surname></editor>
  <editor>Stephanie <surname>Weirich</surname></editor>
  <booktitle>Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, ICFP 2010, Baltimore, Maryland, USA, September 27-29, 2010</booktitle>
  <publisher>ACM</publisher>
  <pages>157&#8211;168</pages>
  <doi>10.1145/1863543.1863568</doi>
 </citation>
 <citation type="article" key="skew">
  <author>Korn&#233;l <surname>Szlach&#225;nyi</surname></author>
  <year>2012</year>
  <title>Skew-monoidal categories and bialgebroids</title>
  <journal>Advances in Mathematics</journal>
  <volume>231</volume>
  <number>3-4</number>
  <pages>1694&#8211;1730</pages>
  <doi>10.1016/j.aim.2012.06.027</doi>
 </citation>
 <citation type="inproceedings" key="wadler91use">
  <author>Philip <surname>Wadler</surname></author>
  <year>1992</year>
  <title>There's no substitute for linear logic</title>
  <booktitle>8th International Workshop on the Mathematical Foundations of Programming Semantics</booktitle>
 </citation>
 <citation type="inproceedings" key="XavierORN18">
  <author>Bruno <surname>Xavier</surname></author>
  <author>Carlos <surname>Olarte</surname></author>
  <author>Giselle <surname>Reis</surname></author>
  <author>Vivek <surname>Nigam</surname></author>
  <year>2017</year>
  <title>Mechanizing Focused Linear Logic in Coq</title>
  <booktitle>12th Workshop on Logical and Semantic Frameworks, with Applications</booktitle>
  <series>ENTCS</series>
  <volume>338</volume>
  <publisher>Elsevier</publisher>
  <pages>219&#8211;236</pages>
  <doi>10.1016/j.entcs.2018.10.014</doi>
 </citation>
</bibliography>
