Ernesto Copello, Alvaro Tasistro, Bruno Bianchi. Case of (Quite) Painless Dependently Typed Programming: Fully Certified Merge Sort in Agda. In Fernando Magno Quintão Pereira, editor, Programming Languages - 18th Brazilian Symposium, SBLP 2014, Maceio, Brazil, October 2-3, 2014. Proceedings. Volume 8771 of Lecture Notes in Computer Science, pages 62-76, Springer, 2014. [doi]
@inproceedings{CopelloTB14,
title = {Case of (Quite) Painless Dependently Typed Programming: Fully Certified Merge Sort in Agda},
author = {Ernesto Copello and Alvaro Tasistro and Bruno Bianchi},
year = {2014},
doi = {10.1007/978-3-319-11863-5_5},
url = {http://dx.doi.org/10.1007/978-3-319-11863-5_5},
researchr = {https://researchr.org/publication/CopelloTB14},
cites = {0},
citedby = {0},
pages = {62-76},
booktitle = {Programming Languages - 18th Brazilian Symposium, SBLP 2014, Maceio, Brazil, October 2-3, 2014. Proceedings},
editor = {Fernando Magno Quintão Pereira},
volume = {8771},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-11862-8},
}