{"id":4347,"date":"2014-06-15T17:38:22","date_gmt":"2014-06-15T15:38:22","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=4347"},"modified":"2014-06-15T17:38:22","modified_gmt":"2014-06-15T15:38:22","slug":"lecturas-del-grupo-de-logica-computacional-del-8-al-15-de-junio","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/lecturas-del-grupo-de-logica-computacional-del-8-al-15-de-junio\/","title":{"rendered":"Lecturas del Grupo de L\u00f3gica Computacional (del 8 al 15 de junio)"},"content":{"rendered":"<p>Esta entrada es una recopilaci\u00f3n de lecturas compartidas esta semana (del 8 al 15 de junio) en la lista de correo del <a href=\"https:\/\/www.glc.us.es\">grupo de l\u00f3gica computacional<\/a><\/p>\n<p>La recopilaci\u00f3n est\u00e1 ordenada por la fecha de su publicaci\u00f3n en <a href=\"https:\/\/twitter.com\/Jose_A_Alonso\">Twitter<\/a>. Al final de cada art\u00edculo se encuentra etiquetas relativas a los sistemas que usa o a su contenido.<\/p>\n<ul>\n<li><a href=\"http:\/\/bit.ly\/1o2pn2Q\">La s\u00e9mantique, c\u2019est romantique (S\u00e9mantique des preuves et des programmes et math\u00e9matiques certifi\u00e9es)<\/a>. ~ P. Pansu <\/li>\n<li><a href=\"http:\/\/bit.ly\/1o2qa3O\">Is this a proof? (Seeking the limits of mathematical proofs)<\/a>. ~ D. Lipton &amp; K. Regan <\/li>\n<li><a href=\"http:\/\/bit.ly\/1ptwTBn\">Social processes and proofs of theorems and programs<\/a>. ~ R.A. De Millo, R.J. Lipton &amp; A.J. Perlis #Proofs <\/li>\n<li><a href=\"http:\/\/bit.ly\/1mv5X07\">Social processes, program verification and all that<\/a>. ~ A. Asperti, H. Geuvers &amp; R. Natarajan. #Proofs <\/li>\n<li><a href=\"http:\/\/bit.ly\/HSihJ8\">Proof, message and certificate<\/a>. ~ A. Asperti #Proofs<\/li>\n<li><a href=\"http:\/\/bit.ly\/GKcDDp\">Computers and the sociology of mathematical proof<\/a>. ~ D. MacKenzie #Proofs<\/li>\n<li><a href=\"http:\/\/bit.ly\/1uJMrmD\">Boolean expression checkers<\/a>. ~ T. Nipkow #AFP #Isabelle_HOL<\/li>\n<li><a href=\"http:\/\/bit.ly\/1paterK\">Evaluating Haskell expressions in a tutoring environment<\/a>. ~ T. Olmer, B. Heeren &amp; J. Jeuring #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/1patVl1\">Flipped graduate classroom in a Haskell-based software testing course<\/a>. ~ J. van Eijck &amp; V. Zaytsev #Haskell<\/li>\n<li><a href=\"http:\/\/buff.ly\/1maq8RT\">Verified networking using dependent types<\/a>. ~  S. Fowler #Idris<\/li>\n<li><a href=\"http:\/\/bit.ly\/1hgrKvW\">NLCertify: A tool for formal nonlinear optimization<\/a>. ~ V. Magron #Coq<\/li>\n<li><a href=\"http:\/\/bit.ly\/1l3kBjI\">Haxl, el framework Haskell para acceder a datos<\/a>. ~ E. Goette  #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/1kyZaGS\">Applications of SMT solvers to program verification<\/a>. ~ N. Bj\u00f8rner &amp; L. de Moura #SMT<\/li>\n<li><a href=\"http:\/\/bit.ly\/1xqYaZN\">Set theory or higher order logic to represent auction concepts in Isabelle<\/a>? ~ M.B. Caminati et als. #Isabelle_HOL<\/li>\n<li><a href=\"http:\/\/bit.ly\/TVzclX\">Spreadsheet-like programming in Haskell<\/a>. ~ G. Gonzalez  #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/1nsmhBW\">Computerising mathematical text<\/a>. ~ F. Kamareddine et als. <\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Esta entrada es una recopilaci\u00f3n de lecturas compartidas esta semana (del 8 al 15 de junio) en la lista de correo del grupo de l\u00f3gica computacional La recopilaci\u00f3n est\u00e1 ordenada por la fecha de su publicaci\u00f3n en Twitter. Al final de cada art\u00edculo se encuentra etiquetas relativas a los sistemas que usa o a su&#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":[177],"tags":[],"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\/4347"}],"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=4347"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/4347\/revisions"}],"predecessor-version":[{"id":4348,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/4347\/revisions\/4348"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=4347"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=4347"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=4347"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}