Unsolvability of the Quintic Formalized in Dependent Type Theory. Bernard, S., Cohen, C., Mahboubi, A., & Strub, P. In Cohen, L. & Kaliszyk, C., editors, 12th International Conference on Interactive Theorem Proving, ITP 2021, June 29 to July 1, 2021, Rome, Italy (Virtual Conference), volume 193, of LIPIcs, pages 8:1–8:18, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Unsolvability of the Quintic Formalized in Dependent Type Theory [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/itp/BernardCMS21,
  author = {Sophie Bernard and Cyril Cohen and Assia Mahboubi and
Pierre{-}Yves Strub},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl = {https://dblp.org/rec/conf/itp/BernardCMS21.bib},
  booktitle = {12th International Conference on Interactive Theorem
Proving, {ITP} 2021, June 29 to July 1, 2021, Rome,
Italy (Virtual Conference)},
  doi = {10.4230/LIPIcs.ITP.2021.8},
  editor = {Liron Cohen and Cezary Kaliszyk},
  isbn = {978-3-95977-188-7},
  pages = {8:1--8:18},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r
Informatik},
  series = {LIPIcs},
  timestamp = {Mon, 21 Jun 2021 14:45:49 +0200},
  title = {Unsolvability of the Quintic Formalized in Dependent
Type Theory},
  url = {https://doi.org/10.4230/LIPIcs.ITP.2021.8},
  volume = {193},
  year = {2021}
}

Downloads: 0