Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq. Forster, Y. & Smolka, G. In Ayala-Rincón, M. & Muñoz, C. A., editors, Interactive Theorem Proving - 8th International Conference, ITP 2017, Brasília, Brazil, September 26-29, 2017, Proceedings, volume 10499, of Lecture Notes in Computer Science, pages 189–206, 2017. Springer.
Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/itp/ForsterS17,
  author    = {Yannick Forster and
               Gert Smolka},
  editor    = {Mauricio Ayala{-}Rinc{\'{o}}n and
               C{\'{e}}sar A. Mu{\~{n}}oz},
  title     = {Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq},
  booktitle = {Interactive Theorem Proving - 8th International Conference, {ITP}
               2017, Bras{\'{\i}}lia, Brazil, September 26-29, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10499},
  pages     = {189--206},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-66107-0\_13},
  doi       = {10.1007/978-3-319-66107-0\_13},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/itp/ForsterS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0