%0 Conference Paper %1 conf/sblp/CopelloTB14 %A Copello, Ernesto %A Tasistro, Alvaro %A Bianchi, Bruno %B SBLP %D 2014 %E Pereira, Fernando Magno Quintão %I Springer %K dblp %P 62-76 %T Case of (Quite) Painless Dependently Typed Programming: Fully Certified Merge Sort in Agda. %U http://dblp.uni-trier.de/db/conf/sblp/sblp2014.html#CopelloTB14 %V 8771 %@ 978-3-319-11862-8

@inproceedings{conf/sblp/CopelloTB14, added-at = {2017-05-26T00:00:00.000+0200}, author = {Copello, Ernesto and Tasistro, Alvaro and Bianchi, Bruno}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2c2627fae535e336c1dff84c6fdf0be8a/dblp}, booktitle = {SBLP}, crossref = {conf/sblp/2014}, editor = {Pereira, Fernando Magno Quintão}, ee = {https://doi.org/10.1007/978-3-319-11863-5_5}, interhash = {a0ed47083801a7be7a24d77a171f39a2}, intrahash = {c2627fae535e336c1dff84c6fdf0be8a}, isbn = {978-3-319-11862-8}, keywords = {dblp}, pages = {62-76}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-27T14:04:06.000+0200}, title = {Case of (Quite) Painless Dependently Typed Programming: Fully Certified Merge Sort in Agda.}, url = {http://dblp.uni-trier.de/db/conf/sblp/sblp2014.html#CopelloTB14}, volume = 8771, year = 2014 }