Certified undecidability of intuitionistic linear logic via binary stack machines and minsky machines. Forster, Y. & Larchey-Wendling, D. In Mahboubi, A. & Myreen, M. O., editors, Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2019, Cascais, Portugal, January 14-15, 2019, pages 104–117, 2019. ACM.
Certified undecidability of intuitionistic linear logic via binary stack machines and minsky machines [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/cpp/ForsterL19,
  author    = {Yannick Forster and
               Dominique Larchey{-}Wendling},
  editor    = {Assia Mahboubi and
               Magnus O. Myreen},
  title     = {Certified undecidability of intuitionistic linear logic via binary
               stack machines and minsky machines},
  booktitle = {Proceedings of the 8th {ACM} {SIGPLAN} International Conference on
               Certified Programs and Proofs, {CPP} 2019, Cascais, Portugal, January
               14-15, 2019},
  pages     = {104--117},
  publisher = {{ACM}},
  year      = {2019},
  url       = {https://doi.org/10.1145/3293880.3294096},
  doi       = {10.1145/3293880.3294096},
  timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/cpp/ForsterL19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0