{"id":5017,"date":"2015-09-14T07:36:37","date_gmt":"2015-09-14T05:36:37","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=5017"},"modified":"2015-09-14T07:36:37","modified_gmt":"2015-09-14T05:36:37","slug":"resena-case-of-quite-painless-dependently-typed-programming-fully-certified-merge-sort-in-agda","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/resena-case-of-quite-painless-dependently-typed-programming-fully-certified-merge-sort-in-agda\/","title":{"rendered":"Rese\u00f1a: Case of (quite) painless dependently typed programming: Fully certified merge sort in Agda"},"content":{"rendered":"<p>Se ha publicado un art\u00edculo de razonamiento formalizado en <a href=\"http:\/\/wiki.portal.chalmers.se\/agda\/pmwiki.php\">Agda<\/a> titulado <a href=\"http:\/\/bit.ly\/1NcUanX\">Case of (quite) painless dependently typed programming: Fully certified merge sort in Agda<\/a>.<\/p>\n<p>Sus autores son <a href=\"http:\/\/fi.ort.edu.uy\/ernesto-copello-en\">Ernesto Copello<\/a>, <a href=\"http:\/\/fi.ort.edu.uy\/alvaro-tasistro-en\">\u00c1lvaro Tasistro<\/a> y <a href=\"http:\/\/bit.ly\/1J6NCRy\">Bruno Bianchi<\/a> (del <a href=\"http:\/\/fi.ort.edu.uy\/compute\/english-version\">Grupo de Computaci\u00f3n Te\u00f3rica (Compute)<\/a> en la <a href=\"http:\/\/bit.ly\/1OpedAg\">Universidad ORT<\/a>, Uruguay).<\/p>\n<p>Su resumen es<\/p>\n<blockquote><p>\n  We present a full certification of merge sort in the language Agda. It features: termination warrant without explicit proof, no proof cost to ensure that the output is sorted, and a succinct proof that the output is a permutation of the input.\n<\/p><\/blockquote>\n<p>El trabajo se ha presentado en <a href=\"http:\/\/www.ic.ufal.br\/evento\/cbsoft2014\/en\/sblp.html\">The Brazilian Symposium on Programming Languages (SBLP)<\/a>.<\/p>\n<p>El c\u00f3digo de las correspondientes teor\u00edas en Agda se encuentra <a href=\"https:\/\/github.com\/ernius\/mergesort\">aqu\u00ed<\/a>.<\/p>\n<p>Este art\u00edculo puede servir de lectura complementaria en los cursos de <a href=\"http:\/\/www.cs.us.es\/~jalonso\/cursos\/m-ra\">Razonamiento autom\u00e1tico<\/a>, <a href=\"http:\/\/www.cs.us.es\/cursos\/rac\/\">Razonamiento asistido por ordenador<\/a> y <a href=\"http:\/\/www.cs.us.es\/~mjoseh\/LCyTM-15\">L\u00f3gica computacional y teor\u00eda de modelos<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Se ha publicado un art\u00edculo de razonamiento formalizado en Agda titulado Case of (quite) painless dependently typed programming: Fully certified merge sort in Agda. Sus autores son Ernesto Copello, \u00c1lvaro Tasistro y Bruno Bianchi (del Grupo de Computaci\u00f3n Te\u00f3rica (Compute) en la Universidad ORT, Uruguay). Su resumen es We present a full certification of merge&#8230;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[100],"tags":[195,285],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_likes_enabled":false,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/5017"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/comments?post=5017"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/5017\/revisions"}],"predecessor-version":[{"id":5018,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/5017\/revisions\/5018"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=5017"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=5017"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=5017"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}