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. 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
{"_id":"Bmt8XHm2ftymrffsT","bibbaseid":"forster-larcheywendling-certifiedundecidabilityofintuitionisticlinearlogicviabinarystackmachinesandminskymachines-2019","author_short":["Forster, Y.","Larchey-Wendling, D."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Yannick"],"propositions":[],"lastnames":["Forster"],"suffixes":[]},{"firstnames":["Dominique"],"propositions":[],"lastnames":["Larchey-Wendling"],"suffixes":[]}],"editor":[{"firstnames":["Assia"],"propositions":[],"lastnames":["Mahboubi"],"suffixes":[]},{"firstnames":["Magnus","O."],"propositions":[],"lastnames":["Myreen"],"suffixes":[]}],"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","bibtex":"@inproceedings{DBLP:conf/cpp/ForsterL19,\n author = {Yannick Forster and\n Dominique Larchey{-}Wendling},\n editor = {Assia Mahboubi and\n Magnus O. Myreen},\n title = {Certified undecidability of intuitionistic linear logic via binary\n stack machines and minsky machines},\n booktitle = {Proceedings of the 8th {ACM} {SIGPLAN} International Conference on\n Certified Programs and Proofs, {CPP} 2019, Cascais, Portugal, January\n 14-15, 2019},\n pages = {104--117},\n publisher = {{ACM}},\n year = {2019},\n url = {https://doi.org/10.1145/3293880.3294096},\n doi = {10.1145/3293880.3294096},\n timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/cpp/ForsterL19.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Forster, Y.","Larchey-Wendling, D."],"editor_short":["Mahboubi, A.","Myreen, M. O."],"key":"DBLP:conf/cpp/ForsterL19","id":"DBLP:conf/cpp/ForsterL19","bibbaseid":"forster-larcheywendling-certifiedundecidabilityofintuitionisticlinearlogicviabinarystackmachinesandminskymachines-2019","role":"author","urls":{"Paper":"https://doi.org/10.1145/3293880.3294096"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/188/5682-2.bib","dataSources":["5syoA3E4Kc7JZpcPK"],"keywords":[],"search_terms":["certified","undecidability","intuitionistic","linear","logic","via","binary","stack","machines","minsky","machines","forster","larchey-wendling"],"title":"Certified undecidability of intuitionistic linear logic via binary stack machines and minsky machines","year":2019}