{"id":4344,"date":"2014-06-08T13:16:19","date_gmt":"2014-06-08T11:16:19","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=4344"},"modified":"2014-06-08T13:16:19","modified_gmt":"2014-06-08T11:16:19","slug":"lecturas-del-grupo-de-logica-computacional-del-24-de-mayo-al-8-de-junio","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/lecturas-del-grupo-de-logica-computacional-del-24-de-mayo-al-8-de-junio\/","title":{"rendered":"Lecturas del Grupo de L\u00f3gica Computacional (del 24 de mayo al 8 de junio)"},"content":{"rendered":"<p>Esta entrada es una recopilaci\u00f3n de lecturas compartidas esta semana (del 24 de mayo al 8 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\/1p7PuET\">Generalized arrows<\/a>. ~ A. Megacz #Haskell #Coq <\/li>\n<li><a href=\"http:\/\/bit.ly\/1nIAsl6\">Transitive closure according to Roy-Floyd-Warshall<\/a>. ~ M. Wenzel #AFP #Isabelle_HOL<\/li>\n<li><a href=\"http:\/\/bit.ly\/1gtqR2T\">Composing and decomposing data types (A closed type families implementation of data types \u00e0 la carte)<\/a>. ~ P. Bahr #Haskell <\/li>\n<li><a href=\"http:\/\/bit.ly\/1oizuzV\">Formalization of complex vectors in higher-order logic<\/a>. ~  S. Khan-Afshar et als. #HOL_Light <\/li>\n<li><a href=\"http:\/\/bit.ly\/1kfAAK4\">Experience report: Type-checking polymorphic units for astrophysics research in Haskell<\/a>. ~ T. Muranushi &amp; R.A. Eisenberg #Haskell <\/li>\n<li><a href=\"http:\/\/bit.ly\/1nIAYj6\">Noninterference security in communicating sequential processes<\/a>. ~ P. Noce #AFP #Isabelle_HOL <\/li>\n<li><a href=\"http:\/\/bit.ly\/1ow7wy7\">Logic programming as scripting language for bots in computer games: Research overview<\/a>. ~ G. Ja\u015bkiewicz #Prolog <\/li>\n<li><a href=\"http:\/\/bit.ly\/1jk0OWF\">The pitfalls of protocol design (Attempting to write a formally verified PDF parser)<\/a>. ~ A. Bogk &amp; M. Sch\u00f6pl #Coq <\/li>\n<li><a href=\"http:\/\/bit.ly\/1jzFa0G\">A fully verified executable LTL model checker<\/a>. ~ J. Esparza et als. #AFP #Isabelle_HOL<\/li>\n<li><a href=\"http:\/\/bit.ly\/TKoDlN\">My life with an automatic theorem prover<\/a>. ~ J.C. Blanchette #Sledgehammer #Isabelle_HOL <\/li>\n<li><a href=\"http:\/\/bit.ly\/1tYRNtX\">Programming is social<\/a>. ~ E. Wallingford #Programming<\/li>\n<li><a href=\"http:\/\/bit.ly\/1tYTiZb\">Don&#8217;t learn to code. Learn to think<\/a>. ~ Y. Brikman    <\/li>\n<li><a href=\"http:\/\/bit.ly\/1oiCfRF\">Some constructions on \u03c9-groupoids<\/a>. ~ T. Altenkirch, N. Li &amp; O. Ryp\u00e1cek #Agda <\/li>\n<li><a href=\"http:\/\/bit.ly\/1iIpmcq\">Graphs: a balancing act<\/a>. ~ mazzo.li #Tutorial #Haskell   #Gloss<\/li>\n<li><a href=\"http:\/\/bit.ly\/SnaqtO\">Beautiful code, compelling evidence (Functional programming for information visualization and visual analytics)<\/a>. ~ J.R. Heard #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/RpGgoW\">Using small scale automation to improve both accessibility and readability of formal proofs in geometry<\/a>. ~ P. Boutry et als. #Coq <\/li>\n<li><a href=\"http:\/\/bit.ly\/S6CKjR\">Computer-aided proof of Erd\u00f6s discrepancy properties<\/a>. ~ B. Konev &amp; A. Lisitsa #SAT<\/li>\n<li><a href=\"http:\/\/bit.ly\/1gtAYVa\">A short note about case distinctions in Tarski\u2019s geometry<\/a>. ~ P. Boutry et als. #Coq<\/li>\n<li><a href=\"http:\/\/bit.ly\/1rKh7WP\">Comonads in Haskell<\/a>. ~ D. Overton [Slides] #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/1kLydtU\">Proofs about programs, proofs as programs, and programs as proofs<\/a>! ~ Katherine Ye #Coq<\/li>\n<li><a href=\"http:\/\/bit.ly\/1kLDNwa\">Lazy dynamic programming<\/a>. ~ T. Jelvis #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/1kLJ32W\">A major upgrade to attoparsec: more speed, more power<\/a>. ~ B. O&#8217;Sullivan #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/1kLHPF1\">Generating mazes with inductive graphs<\/a>. ~ T. Jelvis #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/UdQ9IM\">Monadic parsers: Implementing a micro Parsec<\/a>. ~ O. Iqbal #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/UdTHdP\">Installing GHC and working with Cabal<\/a>. ~ @ReichertBros [Slides]  #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/1pIa9zT\">Formal verification of control systems\u2019 properties with theorem proving<\/a>. ~ D. Araiza-Illan et als. #Why3<\/li>\n<li><a href=\"http:\/\/bit.ly\/Scbe4i\">Learn physics by programming in Haskell<\/a>. ~ S.N. Walck #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/ThHxjv\">Formalized, effective domain theory in Coq<\/a>. ~ R. Dockins #Coq<\/li>\n<li><a href=\"http:\/\/bit.ly\/1mX2clx\">Course on a mathematical presentation of functional programming<\/a>. ~ A. Tasistro, J. Michelini &amp; N. Szasz #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/SxXTUh\">Hardware design using Haskell and C\u03bbaSH<\/a>. ~ R. Wester, J. Kuper &amp; C. Baaij #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/1kIrZzI\">System description: Isabelle\/jEdit in 2014<\/a>. ~ M. Wenzel #Isabelle_HOL<\/li>\n<li><a href=\"http:\/\/bit.ly\/1xr7wom\">Comonads, life and Klein bottles<\/a>. ~ Idontgetoutmuch\u2019s Weblog #Haskell<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Esta entrada es una recopilaci\u00f3n de lecturas compartidas esta semana (del 24 de mayo al 8 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&#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":[292],"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\/4344"}],"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=4344"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/4344\/revisions"}],"predecessor-version":[{"id":4345,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/4344\/revisions\/4345"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=4344"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=4344"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=4344"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}