Coq without Type Casts: A Complete Proof of Coq Modulo Theory. Jouannaud, J. & Strub, P. In Eiter, T. & Sands, D., editors, LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017, volume 46, of EPiC Series in Computing, pages 474–489, 2017. EasyChair.
Coq without Type Casts: A Complete Proof of Coq Modulo Theory [link]Paper  doi  bibtex   2 downloads  
@inproceedings{DBLP:conf/lpar/JouannaudS17,
  author = {Jean{-}Pierre Jouannaud and Pierre{-}Yves Strub},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl = {https://dblp.org/rec/conf/lpar/JouannaudS17.bib},
  booktitle = {LPAR-21, 21st International Conference on Logic for
Programming, Artificial Intelligence and Reasoning,
Maun, Botswana, May 7-12, 2017},
  doi = {10.29007/bjpg},
  editor = {Thomas Eiter and David Sands},
  pages = {474--489},
  publisher = {EasyChair},
  series = {EPiC Series in Computing},
  timestamp = {Sun, 15 Aug 2021 01:00:00 +0200},
  title = {Coq without Type Casts: {A} Complete Proof of Coq
Modulo Theory},
  url = {https://doi.org/10.29007/bjpg},
  volume = {46},
  year = {2017}
}

Downloads: 2