{"id":1440,"date":"2011-07-18T10:58:56","date_gmt":"2011-07-18T10:58:56","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/lecturas-compartidas-en-twitter-del-5-de-febrero-al-17-de-julio-de-2011\/"},"modified":"2011-09-03T10:17:36","modified_gmt":"2011-09-03T10:17:36","slug":"lecturas-compartidas-en-twitter-del-5-de-febrero-al-17-de-julio-de-2011","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/lecturas-compartidas-en-twitter-del-5-de-febrero-al-17-de-julio-de-2011\/","title":{"rendered":"Lecturas compartidas en Twitter (del 5 de Febrero al 17 de Julio de 2011)"},"content":{"rendered":"

Esta entrada es una recopilaci\u00f3n de lecturas que he compartido en Twitter<\/a>. La recopilaci\u00f3n de los tweets est\u00e1 ordenada seg\u00fan la fecha de su publicaci\u00f3n en Twitter<\/a>.
\n<\/p>\n

Julio 2011<\/h2>\n
    \n
  1. \nThe Infinitude of the Primes<\/a>. #Haskell #Matem\u00e1ticas\n<\/li>\n
  2. \nCelestial Emporium (17-Jul-2011)<\/a>.\n<\/li>\n
  3. \nResolvendo Desafios mais complicados com Prolog<\/a>. #Prolog (RT @andreiformiga)\n<\/li>\n
  4. \nThe unreasonable effectiveness of logic<\/a> by Philip Wadler. #L\u00f3gica #Computaci\u00f3n\n<\/li>\n
  5. \nA critique of Abelson and Sussman or why calculating is better than scheming<\/a> by Philip Walder. #Haskell #Lisp (RT @joseanpg)\n<\/li>\n
  6. \nProofs are Programs<\/a>. #L\u00f3gica #Computaci\u00f3n (RT @joseanpg)\n<\/li>\n
  7. \nHow real are real numbers?<\/a> by Gregory Chaitin. #Matem\u00e1ticas #Computaci\u00f3n (RT @MathBits<\/sub>)\n<\/li>\n
  8. \nLa profesi\u00f3n de matem\u00e1tico<\/a>. #Matem\u00e1ticas\n<\/li>\n
  9. \nThe Logical Impingement of AI<\/a> by L.M. Pereira. #L\u00f3gica #AI\n<\/li>\n
  10. \nComputing and the cultures of proving<\/a> by D. MacKenzie. #L\u00f3gica #Matem\u00e1ticas #Computaci\u00f3n\n<\/li>\n
  11. \nHow To Tell Stuff To A Computer: The Enigmatic Art of Knowledge Representation<\/a> by C. Barki.\n<\/li>\n
  12. \nEl dec\u00e1logo del profesor (seg\u00fan Polya)<\/a>. #Docencia #Matem\u00e1ticas\n<\/li>\n
  13. \nEl derecho a leer<\/a> por Richard Stallman.\n<\/li>\n
  14. \nHaskell vs. Ada vs. C++ vs. Awk vs. … (An Experiment in Software Prototyping Productivity)<\/a> by P. Hudak & M.P. Jones. #Haskell\n<\/li>\n
  15. \nLa V\u00e9rit\u00e9 et la Machine<\/a> de Benjamin Werner. #Matem\u00e1ticas #Computaci\u00f3n\n<\/li>\n
  16. \nTeaching the Computer how to Discover(!) and then Prove(!!) (all by Itself(!!!)) …<\/a> by D. Zeilberger.\n<\/li>\n
  17. \nPara qu\u00e9 sirven las matem\u00e1ticas<\/a>.\n<\/li>\n
  18. \nEloquent JavaScript (A Modern Introduction to Programming)<\/a> by M. Haverbeke. #LibroLibre #JavaScript\n<\/li>\n
  19. \nTabla comparativa de la sintaxis de Prolog, Erlang y Oz<\/a>.\n<\/li>\n
  20. \nTabla comparativa de la sintaxis de Common Lisp, Scheme, Clojure y Emacs Lisp<\/a>.\n<\/li>\n
  21. \nTabla comparativa de la sintaxis de Mathematica, Sage y Maxima<\/a>.\n<\/li>\n
  22. \nTabla comparativa de la sintaxis de Standard ML, OCaml, Scala y Haskell<\/a>.\n<\/li>\n
  23. \nOrdenadores, paradojas y fundamentos de las matem\u00e1ticas<\/a> por G.J. Chaitin. #L\u00f3gica #Matem\u00e1ticas #Computaci\u00f3n\n<\/li>\n
  24. \nHaskell y la teor\u00eda de categor\u00edas<\/a>. #Haskell #Matem\u00e1ticas\n<\/li>\n
  25. \nScala: Programa\u00e7\u00e3o OO, Funcional e Concorrente na JVM<\/a>. (RT @andreiformiga)\n<\/li>\n
  26. \nExamen de programaci\u00f3n en Haskell (Julio de 2011)<\/a>. #Haskell #Matem\u00e1ticas\n<\/li>\n
  27. \nA Logical Interpretation of Some Bits of Topology<\/a>. #L\u00f3gica #Topolog\u00eda\n<\/li>\n
  28. \nLogic and Artificial Intelligence<\/a> by R. Thomason. #L\u00f3gica #IA\n<\/li>\n
  29. \nA brief history of logic<\/a> by M.Y. Vardi. #L\u00f3gica #Computaci\u00f3n #Historia\n<\/li>\n
  30. \nOn the Unusual Effectiveness of Logic in Computer Science<\/a>. #L\u00f3gica #Computaci\u00f3n\n<\/li>\n
  31. \nHaskell for Maths<\/a>.\n<\/li>\n
  32. \nHardware languages and proof<\/a> #Tesis #Verificaci\u00f3n #PVS\n<\/li>\n
  33. \nTreatise on Intuitionistic Type Theory<\/a> by J.G. Granstrom. #Book #Logic\n<\/li>\n
  34. \nA theorem proving framework for the formal verification of Web Services Composition<\/a>. #Verificaci\u00f3n #HOLLight<\/sub>\n<\/li>\n
  35. \nMetadata for a mathematical wiki: Initial experiments<\/a>. #Matem\u00e1ticas #Wiki #WebSemantica\n<\/li>\n
  36. \nInteractive Theorem Proving and the Formalisation of Mathematics<\/a>. #Matem\u00e1ticas\n<\/li>\n
  37. \nJohn Hughes Contrasts Erlang and Haskell<\/a>\n<\/li>\n
  38. \nLogic is not logic<\/a> by Jean-Yves B\u00e9ziau. #L\u00f3gica\n<\/li>\n
  39. \nVi\u00e8te, Descartes, and the Emergence of Modern Mathematics<\/a> by D. Macbeth #Historia #Matem\u00e1ticas (RT @MathBits<\/sub>)\n<\/li>\n
  40. \nGeorg Cantor, el club de Groucho y el tama\u00f1o del infinito<\/a>. (v\u00eda @recuerdopandora)\n<\/li>\n
  41. \nWhy Lisp is a Big Hack (And Haskell is Doomed to Succeed)<\/a>. #Lisp #Haskell\n<\/li>\n
  42. \nMIT introduction to computer science<\/a>. #Python #CS\n<\/li>\n
  43. \nVestigium: El problema de las puertas en Haskell<\/a>. #Haskell #Matem\u00e1ticas\n<\/li>\n
  44. \nRetrato humor\u00edstico del matem\u00e1tico t\u00edpico<\/a>. #Matem\u00e1ticas\n<\/li>\n
  45. \nThe Ideal Mathematician<\/a> by P. Davis and R. Hersh.\n<\/li>\n
  46. \nRecopilaci\u00f3n de publicaciones sobre la cultura matem\u00e1tica<\/a>. #Matem\u00e1ticas\n<\/li>\n
  47. \nAn argument for \u201cmeta-mathematics\u201d<\/a>. #Matem\u00e1ticas\n<\/li>\n
  48. \nVestigium: Razonamiento formalizado para la ense\u00f1anza de las matem\u00e1ticas<\/a>. #Matem\u00e1ticas #RazonamientoFormalizado\n<\/li>\n
  49. \nHaskell: A Whirlwind Tour (Part 2\/2)<\/a> by William Taysom.\n<\/li>\n
  50. \nHaskell: A Whirlwind Tour (Part 1\/2)<\/a> by William Taysom.\n<\/li>\n
  51. \nEntrevista con Manuel Simoni “Lisp: The Programmable Programming Language”<\/a>\n<\/li>\n
  52. \nZen and the art of formalization<\/a>. #FormalizedReasoning\n<\/li>\n<\/ol>\n

    Junio 2011<\/h2>\n
      \n
    1. \nCoding Guidelines for Prolog<\/a> by Michael A. Covington et als. #Prolog\n<\/li>\n
    2. \nA Pearl on SAT Solving in Prolog<\/a>. #Prolog #SAT\n<\/li>\n
    3. \nSAT solver of Howe & King as a logic program<\/a>. #Polog #SAT\n<\/li>\n
    4. \nIsabelle Repository for Relational and Algebraic Methods<\/a>. #RazonamientoFormalizado #Isabelle #Matem\u00e1ticas\n<\/li>\n
    5. \nWhy Verify Software?<\/a>.\n<\/li>\n
    6. \nWhat\u2019s Fun About Teaching<\/a>.\n<\/li>\n
    7. \nEntrevista a Knuth “La inform\u00e1tica se asocia con el dinero y no con la ciencia”<\/a>.\n<\/li>\n
    8. \nWriting software is more an art than an engineering discipline<\/a>\n<\/li>\n
    9. \nI1M2010: Examen de programaci\u00f3n en Haskell<\/a>. #Haskell #Matem\u00e1ticas\n<\/li>\n
    10. \nConstructive mathematics<\/a> by Phil Wilson. #L\u00f3gica #Matem\u00e1ticas\n<\/li>\n
    11. \nSearching for the missing truth<\/a> by Marianne Freiberger. #L\u00f3gica #Matem\u00e1ticas\n<\/li>\n
    12. \nThe philosophy of applied mathematics<\/a> by Phil Wilson.\n<\/li>\n
    13. \nWhy Johnny can’t program and how that can change<\/a>. (via @vardi)\n<\/li>\n
    14. \nRemembering Alan Turing on his 99th birthday<\/a>. #Turing\n<\/li>\n
    15. \nVestigium: Un problema de las olimpiadas rusas en Haskell<\/a>. #Haskell #Matem\u00e1tica\n<\/li>\n
    16. \nProgramas l\u00f3gicos para conjuntos de conocimiento<\/a>. #Prolog\n<\/li>\n
    17. \nSobre la indecidibilidad de la indecidibilidad<\/a> por Gustavo Pi\u00f1eiro. #Godel #L\u00f3gica\n<\/li>\n
    18. \nSolving the Unsolvable<\/a> by Vardi. #Indecibilidad\n<\/li>\n
    19. \nHigh-Performance Web Applications in Haskell<\/a> by Gregory Collins. #Haskell\n<\/li>\n
    20. \nGlasgow Haskell vs. Lispworks<\/a>. #Haskell #GHC #Lisp\n<\/li>\n
    21. \nCommon Lisp – Myths and Legends<\/a>. #Lisp\n<\/li>\n
    22. \nPractical Common Lisp<\/a> by Peter Seibel. #LibroLibre #Lisp\n<\/li>\n
    23. \nIntroduction to Lambda Calculus<\/a> by H. Barendregt, E. Barendsen.\n<\/li>\n
    24. \nType classes for efficient exact real arithmetic in Coq<\/a> by R. Krebbers, B. Spitters. #Coq #Matem\u00e1tica #Computaci\u00f3n\n<\/li>\n
    25. \nDeciding Kleene Algebras in Coq<\/a>. #RazonamientoFormalizado #Coq\n<\/li>\n
    26. \nMathematical Background<\/a> by John F. Sowa. #L\u00f3gica #Matem\u00e1tica #Computaci\u00f3n\n<\/li>\n
    27. \nIntroduction to Mathematical Logic<\/a> by Vilnis Detlovs. #LibroLibre #L\u00f3gica #Matem\u00e1ticas\n<\/li>\n
    28. \nWriting a simple plagiarism detector in Haskell<\/a> by Tom Moertel.\n<\/li>\n
    29. \nComparaci\u00f3n de la programaci\u00f3n funcional e imperativa<\/a>. #Haskell\n<\/li>\n
    30. \nScientific American: The Power of Theory in Science<\/a>.\n<\/li>\n
    31. \nFunctional Programming Koans, in OCaml<\/a>. #ProgramacionFuncional\n<\/li>\n
    32. \nLogic in Computer Science<\/a> by Michael Winter. #eLibro #L\u00f3gica\n<\/li>\n
    33. \nAutomated Engineering of Relational and Algebraic Methods in Isabelle\/HOL<\/a>. #RazonamientoFormalizado #Isabelle\n<\/li>\n
    34. \nHaskell Monoids and their Uses<\/a>. #Haskell (RT @MarimuthuM)\n<\/li>\n
    35. \nThe History and Concept of Mathematical Proof<\/a> by Steven G. Krantz. #Matem\u00e1ticas\n<\/li>\n
    36. \nVestigium: Libro de ejercicios de programaci\u00f3n con Haskell<\/a>. #Haskell\n<\/li>\n
    37. \nI1M2010: Operaciones con el El TAD de los polinomios en Haskell<\/a>. #Haskell\n<\/li>\n
    38. \nI1M2010: El TAD de los polinomios en Haskell<\/a>. #Haskell\n<\/li>\n
    39. \nI1M2010: Ejercicios sobre la numeraci\u00f3n de los racionales en Haskell<\/a>. #Haskell #Matem\u00e1ticas\n<\/li>\n
    40. \nEntrevista a Donald Knuth realizada por Dikran Karagueuzian (director de CSLI Publications)<\/a>.\n<\/li>\n
    41. \nEntrevista a Donald Knuth con motivo del premio Fronteras del Conocimiento<\/a>.\n<\/li>\n
    42. \nThe Proof is in the Pudding (A Look at the Changing Nature of Mathematical Proof)<\/a> by Steven G. Krantz. #LibroLibre\n<\/li>\n
    43. \nFormal proofs in real algebraic geometry: from ordered fields to quantifier elimination<\/a>. #RazonamientoFormalizado #Coq\n<\/li>\n
    44. \nEntrevista a Simon Peyton-Jones sobre el desarrollo de Haskell<\/a>. (v\u00eda @joseanpg)\n<\/li>\n
    45. \nWearing the hair shirt (A retrospective on #Haskell)<\/a> by Simon Peyton Jones. (v\u00eda @joseanpg)\n<\/li>\n
    46. \nLa paradoja de Skolem en ProofWiki<\/a>. #Matem\u00e1ticas #L\u00f3gica\n<\/li>\n
    47. \nEleven Reasons to use Haskell as a Mathematician<\/a> #Haskell #Matem\u00e1ticas\n<\/li>\n
    48. \nProofWiki: recopilaci\u00f3n colaborativa de demostraciones matem\u00e1ticas<\/a>. #Matem\u00e1ticas\n<\/li>\n
    49. \nTutorial sobre el desarrollo en Haskell de aplicaciones para el iPhone<\/a>.\n<\/li>\n
    50. \nProgramming Languages: Application and Interpretation<\/a> by S. Krishnamurthi. #LibroLibre #Programacion #Haskell #Lisp\n<\/li>\n
    51. \nMathematical logic and computability<\/a> by J. Keisler et als. #LibroLibre #L\u00f3gica #Computaci\u00f3n\n<\/li>\n
    52. \nHistory of Lambda-calculus and Combinatory Logic<\/a>. #L\u00f3gica #Computaci\u00f3n\n<\/li>\n
    53. \nEntrevista a Rich Hickey (creador de Clojure) en Code Quarterly<\/a>. #Programacion #Clojure\n<\/li>\n
    54. \nEntrevista a H. Abelson (coautor de “Structure and Interpretation of Computer Programs”) en Code Quarterly<\/a>.\n<\/li>\n
    55. \nThe MathScheme Library: Some Preliminary Experiments<\/a>. #Computaci\u00f3n #Matem\u00e1ticas #Scheme\n<\/li>\n
    56. \nBlown to Bits (Your Life, Liberty, and Happiness After the Digital Explosion)<\/a> by H. Abelson et als. #LibroLibre\n<\/li>\n
    57. \nTough SAT: Un generador de f\u00f3rmulas en FNC en formato DIMACS para sistemas SAT<\/a>. #L\u00f3gica #SAT\n<\/li>\n
    58. \nInitial Semantics for Higher-Order Typed Syntax in Coq<\/a> by B. Ahrens, J. Zsido. #L\u00f3gica #Computaci\u00f3n #Coq\n<\/li>\n
    59. \nEl primer teorema de incompletitud de G\u00f6del (en 4 clases de Peter Smith)<\/a>. #L\u00f3gica\n<\/li>\n
    60. \nGeneralising G\u00f6del’s Theorem with Multiple Worlds. Part IV<\/a>. #L\u00f3gica #Haskell\n<\/li>\n
    61. \nGeneralising G\u00f6del’s Theorem with Multiple Worlds. Part III<\/a>. #L\u00f3gica #Haskell\n<\/li>\n
    62. \nGeneralising G\u00f6del’s Theorem with Multiple Worlds. Part II<\/a>. #L\u00f3gica #Haskell\n<\/li>\n
    63. \nGeneralising G\u00f6del’s Theorem with Multiple Worlds. Part I<\/a>. #L\u00f3gica #Haskell\n<\/li>\n
    64. \nBrute Force SAT Solver in Haskell<\/a> by @andreiformiga #L\u00f3gica #Haskell\n<\/li>\n
    65. \nKurt G\u00f6del and the Foundations of Mathematics: Horizons of Truth<\/a>.\n<\/li>\n
    66. \nApplications of Logic in Social Choice Theory<\/a> by U. Endriss.\n<\/li>\n
    67. \nProblemas de laberintos en Haskell<\/a>.\n<\/li>\n
    68. \nSobre Lakatos, la demostraci\u00f3n de la conjetura de Collatz, su refutaci\u00f3n y una tipolog\u00eda de art\u00edculos matematicas<\/a>\n<\/li>\n
    69. \nMathematical and Logical Basis of Computing: a Workbook<\/a> by Howard A. Blair. #L\u00f3gica #Matem\u00e1ticas #Computaci\u00f3n\n<\/li>\n
    70. \nMathematical Logic Lecture Notes<\/a> by Lou van den Dries. #Libro #L\u00f3gica\n<\/li>\n
    71. \nElementary Calculus: An Infinitesimal Approach<\/a> by H. Jerome Keisler. #Matem\u00e1ticas\n<\/li>\n
    72. \nLecture notes for Mathematical Logic I<\/a> by Kevin C. Klement #L\u00f3gica\n<\/li>\n
    73. \nMathematical Logic<\/a> by Stephen G. Simpson. #L\u00f3gica\n<\/li>\n
    74. \nCurso de introducci\u00f3n a la l\u00f3gica y sus algoritmos implementados en Haskell<\/a>.\n<\/li>\n
    75. \nWebPIE: A Web-scale parallel inference engine using MapReduce<\/a>.\n<\/li>\n
    76. \nHow I Failed, Failed, and Finally Succeeded at Learning How to Code<\/a> James Somers.\n<\/li>\n
    77. \n10 Scala One Liners to Impress Your Friends<\/a>. #Scala\n<\/li>\n
    78. \nComparaci\u00f3n de la eficiencia de Haskell, Lisp y Maxima mediante la funci\u00f3n de Takeuchi<\/a>. #Haskell #Lisp #Maxima\n<\/li>\n
    79. \n10 Haskell One Liners to Impress Your Friends<\/a>. #Haskell\n<\/li>\n
    80. \nM\u00e9todos l\u00f3gicos de demostraci\u00f3n<\/a>. #L\u00f3gica #Humor\n<\/li>\n
    81. \nUsing ‘Theorema’ in the Formalization of Theoretical Economics<\/a>.\n<\/li>\n
    82. \nAn Application of the Formal Method to Statistics<\/a>.\n<\/li>\n
    83. \nParaconsistencia y computaci\u00f3n cu\u00e1ntica<\/a>.\n<\/li>\n
    84. \nClassical Logic and the Curry\u2013Howard Correspondence<\/a> by F. Lawler.\n<\/li>\n
    85. \nAn Introduction to Proofs and the Mathematical Vernacular<\/a> by Martin V. Day.\n<\/li>\n
    86. \nMathematical Logic. An Introduction<\/a> by P. Koepke. #L\u00f3gica #Matem\u00e1ticas\n<\/li>\n
    87. \nThree Chapters of Measure Theory in Isabelle\/HOL<\/a>. #RazonamientoFormalizado #Matem\u00e1ticas #Computaci\u00f3n\n<\/li>\n
    88. \nModelling Distributed Cognition Systems in PVS<\/a>.\n<\/li>\n
    89. \nA verified runtime for a verified theorem prover<\/a>.\n<\/li>\n
    90. \nI1M2010: Programaci\u00f3n din\u00e1mica en Haskell y el problema del producto de cadenas de matrices<\/a>. #Haskell #Algoritmica\n<\/li>\n
    91. \nLI2011: Unificaci\u00f3n y resoluci\u00f3n en l\u00f3gica de primer orden<\/a>.\n<\/li>\n
    92. \nI1M2010: B\u00fasqueda en escalada en Haskell<\/a>.\n<\/li>\n
    93. \nI1M2010: B\u00fasqueda por primero el mejor en Haskell<\/a>.\n<\/li>\n
    94. \nLogic via Foundational Algorithms<\/a>. #L\u00f3gica #Computaci\u00f3n\n<\/li>\n
    95. \nSpecification and Verification: The Spec# Experience<\/a>.\n<\/li>\n<\/ol>\n

      Mayo 2011<\/h2>\n
        \n
      1. \nMateriales de l\u00f3gica y fundamentos de la matem\u00e1tica recopilados por Alexander Sakharov<\/a>. #L\u00f3gica #Matem\u00e1ticas\n<\/li>\n
      2. \nPanorama de la l\u00f3gica y los fundamentos de la matem\u00e1tica<\/a> por S.G. Simpson. #L\u00f3gica #Matem\u00e1ticas\n<\/li>\n
      3. \nMeta-Mathematics of Computer Programming<\/a> by P.J. Voda. #L\u00f3gica #Computaci\u00f3n\n<\/li>\n
      4. \nTeaching natural deduction as a subversive activity<\/a> by J. Caldwell. #L\u00f3gica\n<\/li>\n
      5. \nLogic and Discrete Mathematics for Computer Scientists<\/a> by J. Caldwell. #L\u00f3gica #Matem\u00e1tica #Computaci\u00f3n #LibroLibre\n<\/li>\n
      6. \nActas del 4\u00ba simposio europeo de Lisp<\/a> (enfocado en el paralelismo y la eficiencia). #Lisp\n<\/li>\n
      7. \nLos problemas abiertos en matem\u00e1ticas desde hace m\u00e1s tiempo<\/a>. #Matem\u00e1ticas (via @AlgebraFact)\n<\/li>\n
      8. \nSyntactic Finitism in the Metatheory of Programming Languages<\/a> Tesis de J. Sarnat.\n<\/li>\n
      9. \nEstado de la demostraci\u00f3n asistida por ordenador (hasta diciembre del 2008)<\/a>. #DAO\n<\/li>\n
      10. \nAniversario del art\u00edculo de Turing \u201cOn Computable Numbers, with an Application to the Entscheidungsproblem\u201d<\/a>.\n<\/li>\n
      11. \nIntegrating Testing and Interactive Theorem Proving<\/a>.\n<\/li>\n
      12. \nVerificaci\u00f3n formal de las tablas de finales de ajedrez<\/a>.\n<\/li>\n
      13. \nSoluci\u00f3n mediante Prolog de un rompecabeza l\u00f3gico<\/a>. #L\u00f3gica #Prolog\n<\/li>\n
      14. \nReflexiones de Gian-Carlo Rota sobre la ense\u00f1anza de las matem\u00e1ticas<\/a>.\n<\/li>\n
      15. \nCombining and Automating Classical and Non-Classical Logics in Classical Higher-Order Logics<\/a>. #RazonamientoAutomatico\n<\/li>\n
      16. \nTermination of Isabelle Functions via Termination of Rewriting<\/a>.\n<\/li>\n
      17. \nRationality and Escalation in Infinite Extensive Games<\/a>. #Coq\n<\/li>\n
      18. \nSigma: An Integrated Development Environment for Formal Ontology<\/a>. #L\u00f3gica #Ontologias\n<\/li>\n
      19. \nTeaching Computational Logic: Technology-enhanced Learning and Animations<\/a>. #L\u00f3gica\n<\/li>\n
      20. \nValidated Compilation through Logic<\/a>. #Verificaci\u00f3n #L\u00f3gica #Computaci\u00f3n\n<\/li>\n
      21. \nLI2011: Formas normales de Skolem<\/a>.\n<\/li>\n
      22. \nI1M2010: 7\u00ba examen del curso de programaci\u00f3n con Haskell<\/a>.\n<\/li>\n
      23. \nWhat Sequential Games, the Tychonoff Theorem and the Double-Negation Shift have in Common<\/a>. #Haskell\n<\/li>\n
      24. \nA Proof-Carrying Code Based Framework for Social Networking<\/a> by S.C. Hanvey.\n<\/li>\n
      25. \nTeaching Computational Logic: Technology-enhanced Learning and Animations<\/a>.\n<\/li>\n
      26. \nManual de comunicaci\u00f3n para investigadores<\/a> elaborado por la Universidad de la Rioja.\n<\/li>\n
      27. \nLa indecibilidad del problema de la parada en Scheme<\/a>. #Scheme (via @arademaker)\n<\/li>\n
      28. \nEl problema de Josephus en Haskell<\/a>. #Haskell\n<\/li>\n
      29. \nMOLTAP Un demostrador autom\u00e1tico basado en tableros para l\u00f3gicas modales y epism\u00e9ticas<\/a>. #L\u00f3gica #RazonamientoAutomatico\n<\/li>\n
      30. \nI1M2010: El patr\u00f3n de b\u00fasqueda en espacios de estados en Haskell<\/a>. #Haskell #Algoritmica\n<\/li>\n
      31. \nI1M2010: El patr\u00f3n de divide y vencer\u00e1s en Haskell<\/a>. #Haskell #Algoritmica\n<\/li>\n
      32. \nI1M2010: Ejercicios sobre el TAD de los grafos en Haskell<\/a>. #Haskell\n<\/li>\n
      33. \n\u00bfPara qu\u00e9 sirven las matem\u00e1ticas? seg\u00fan WeUseMath.org<\/a>. #Matem\u00e1ticas\n<\/li>\n
      34. \nIntroducci\u00f3n a Agda<\/a> por Daniel Peebles. #Agda #Haskell\n<\/li>\n
      35. \nRazones para programar con Haskell<\/a>. #Haskell\n<\/li>\n
      36. \nRecursive types in QuickCheck<\/a>. #Haskell\n<\/li>\n
      37. \n[[http:\/\/bit.ly\/l3CzBZ][Todos los caminos conducen a las matem\u00e1ticas]. #Matem\u00e1ticas\n<\/li>\n
      38. \nLI2011: Tableros sem\u00e1nticos de primer orden<\/a>.\n<\/li>\n
      39. \nLI2011: Ejercicios de deducci\u00f3n natural en l\u00f3gica de primer orden<\/a>.\n<\/li>\n
      40. \nLI2011: Deducci\u00f3n natural en l\u00f3gica de primer orden<\/a>.\n<\/li>\n
      41. \nLa elegancia de Haskell en el procesamiento de series de potencias<\/a>. #Haskell\n<\/li>\n
      42. \nDAO2011: Ejercicios de deducci\u00f3n natural en l\u00f3gica de primer orden con Isabelle\/HOL<\/a>.\n<\/li>\n
      43. \nDAO2011: Deducci\u00f3n natural en l\u00f3gica de primer orden con Isabelle\/HOL<\/a>.\n<\/li>\n
      44. \nDAO2011: Ejercicios de deducci\u00f3n natural proposicional con Isabelle\/HOL<\/a>.\n<\/li>\n
      45. \nDAO2011: Deducci\u00f3n natural proposicional con Isabelle\/HOL<\/a>.\n<\/li>\n
      46. \nDAO2011: Ejercicios de razonamiento sobre programas con Isabelle\/HOL<\/a>.\n<\/li>\n
      47. \nEl arte de resolver problemas<\/a>. #Matem\u00e1ticas #Polya\n<\/li>\n
      48. \nReflexiones de G.B. Dantzig sobre matem\u00e1ticas puras y aplicadas<\/a>. #Matem\u00e1ticas\n<\/li>\n
      49. \nA Survey of Functional Reactive Programming (Concepts, Implementations, Optimizations, and Applications)<\/a> by E. Amsden.\n<\/li>\n
      50. \nThe Algebra of Data, and the Calculus of Mutation<\/a>.\n<\/li>\n
      51. \nWolfgang: A Wolfram Alpha clone in Haskell<\/a>.\n<\/li>\n
      52. \nThe Mathematician (part II)<\/a> by John von Neumann. #Matem\u00e1ticas\n<\/li>\n
      53. \nThe Mathematician (part I)<\/a> by John von Neumann. #Matem\u00e1ticas\n<\/li>\n
      54. \nEjercicios de deducci\u00f3n natural en l\u00f3gica de primer orden<\/a>.\n<\/li>\n
      55. \nThe Proof is in the Pudding (A Look at the Changing Nature of Mathematical Proof)<\/a> by S.G. Krantz. #Matem\u00e1ticas #L\u00f3gica\n<\/li>\n
      56. \nFormal Metatheory of Programming Languages in the Matita Interactive Theorem Prover<\/a>.\n<\/li>\n
      57. \nALPprolog \u2014 A New Logic Programming Method for Dynamic Domains<\/a>. #Prolog #Agentes\n<\/li>\n
      58. \nTRX: A Formally Verified Parser Interpreter<\/a> by A. Koprowski & H, Binsztok #Coq #Verificaci\u00f3n\n<\/li>\n
      59. \nComputational Meta-Ethics: Towards the Meta-Ethical Robot<\/a> by G.J. Lokhorst.\n<\/li>\n
      60. \nModal logic: The Lewis-Modal systems<\/a> by J.J. Zeman. #LibroLibre\n<\/li>\n
      61. \nComputer certified efficient exact reals in Coq<\/a> by R. Krebbers & B. Spitters.\n<\/li>\n
      62. \nThe worst algorithm in the world?<\/a>\n<\/li>\n
      63. \nI1M2010: Implementaci\u00f3n en Haskell de los algoritmos de Kruskal y de Prim<\/a>.\n<\/li>\n
      64. \nLI2011: Sem\u00e1ntica de la l\u00f3gica de primer orden<\/a>.\n<\/li>\n
      65. \nI1M2010: Ejercicios sobre la implementaci\u00f3n en Haskell del TAD de los grafos mediante listas de pares<\/a>.\n<\/li>\n
      66. \nFormaliza\u00e7\u00e3o da prova do teorema de exist\u00eancia de unificadores mais gerais em teorias de primeira-ordem<\/a> by A.B. Avelar.\n<\/li>\n
      67. \nSolving Rubik’s Cube Using SAT Solvers<\/a>.\n<\/li>\n
      68. \nAlgorithmic Mathematics<\/a> by L.Soicher and F. Vivaldi. #LibroLibre #Matem\u00e1ticas #Computaci\u00f3n\n<\/li>\n
      69. \nLearn You a Haskell for Great Good!<\/a>. #LibroLibre #Haskell\n<\/li>\n
      70. \nVestigium: \u201cSorpresa sumando potencias de 2 en Haskell”: Numeraciones de los racionales<\/a>. #Matem\u00e1ticas #Haskell\n<\/li>\n
      71. \nLogical literacy<\/a> by Matt Might.\n<\/li>\n
      72. \nAn Introduction to Category Theory for the working Computer Scientist<\/a>. #LibroLibre (RT @modelpractice)\n<\/li>\n
      73. \nNavigating Cities and Understanding Proofs<\/a>.\n<\/li>\n
      74. \nUsing Wolfram Alpha to prove 1=0<\/a> por Sam Alexander.\n<\/li>\n
      75. \nScala by Example<\/a> de Martin Odersky. #LibroLibre #Programacion #Scala\n<\/li>\n
      76. \nA List-Machine Benchmark for Mechanized Metatheory<\/a> de Andrew W. Appel, *Robert Dockins y Xavier Leroy.\n<\/li>\n
      77. \nFormalizing the C99 standard in HOL, Isabelle and Coq<\/a>.\n<\/li>\n
      78. \nEl Tao del Programador<\/a> de G. James. #LibroLibre #Programacion\n<\/li>\n
      79. \nThe Mathematician as an Explorer<\/a> by Sherman K. Stein.\n<\/li>\n
      80. \nTransition Systems for Model Generators (A Unifying Approach)<\/a> de Y. Lierler y M. Truszczynski. #SAT #ASP #DPLL\n<\/li>\n
      81. \nA Computational Implementation of the Ontological Argument<\/a> por P.E. Oppenheimer y E.N. Zalta. #Prover9\n<\/li>\n
      82. \nProgramming may one day be about getting the maths right<\/a>.\n<\/li>\n
      83. \nWeb tools for online learning of computation theory and logic<\/a> de V. Rocio.\n<\/li>\n<\/ol>\n

        Abril 2011<\/h2>\n
          \n
        1. \nAutomated proof system for Haskell program properties<\/a>.\n<\/li>\n
        2. \nI1M2010: Implementaci\u00f3n en Haskell de los grafos mediante matrices. Algoritmos de recorrido de grafos<\/a>.\n<\/li>\n
        3. \nDAO2011: Ejercicios de razonamiento sobre programas con Isabelle<\/a>.\n<\/li>\n
        4. \nDAO2011: Razonamiento sobre programas funcionales con Isabelle<\/a>.\n<\/li>\n
        5. \nLibro de ejercicios resueltos programaci\u00f3n con Haskell<\/a>.\n<\/li>\n
        6. \nI1M2010: El TAD de los grafos y su implementaci\u00f3n en Haskell mediante vectores de adyacencia<\/a>.\n<\/li>\n
        7. \nI1M2010: Ejercicios sobre vectores y matrices en Haskell (2)<\/a>.\n<\/li>\n
        8. \nI1M2010: Familias de grafos y su representaci\u00f3n gr\u00e1fica<\/a>.\n<\/li>\n
        9. \nI1M2010: Introducci\u00f3n a los grafos<\/a>.\n<\/li>\n
        10. \nI1M2010: Ejercicios sobre vectores y matrices en Haskell (1)<\/a>.\n<\/li>\n
        11. \nI1M2010: Ejercicios sobre el TAD de los mont\u00edculos en Haskell<\/a>.\n<\/li>\n
        12. \nI1M2010: Ejercicios sobre listas infinitas en Haskell<\/a>\n<\/li>\n
        13. \nAutomated Reasoning<\/a> by H. Zantema.\n<\/li>\n
        14. \nFunctional Programming with Python \u2013 Part 2<\/a>.\n<\/li>\n
        15. \nFunctional Programming with Python \u2013 Part 1<\/a>.\n<\/li>\n
        16. \nA Pearl on SAT and SMT Solving in Prolog<\/a>. #L\u00f3gica #Prolog\n<\/li>\n
        17. \nSorpresa sumando potencias de 2<\/a>. (RT @@gaussianos)\n<\/li>\n
        18. \nRet\u00edculo de las conectivas proposicionales<\/a>. #L\u00f3gica\n<\/li>\n
        19. \nConstructive Formalization of Classical Modal Logic<\/a> por Christian Doczkal y Gert Smolka.\n<\/li>\n
        20. \nTeoremas con conclusiones sorprendentes<\/a>. #Matem\u00e1ticas\n<\/li>\n
        21. \nLearn You a Haskell for Great Good!: A Beginner’s Guide<\/a> por Miran Lipovaca. #LibroLibre\n<\/li>\n
        22. \nBasics of Compiler Design<\/a> por T. Mogensen #LibroLibre (v\u00eda @CompSciFact)\n<\/li>\n
        23. \nDiscrete Mathematics Lecture Notes<\/a> by Laszlo Babai. #LibroLibre\n<\/li>\n
        24. \nLI2011: Sintaxis y sem\u00e1ntica de la l\u00f3gica de primer orden<\/a>.\n<\/li>\n
        25. \nLI2011: Representaci\u00f3n del conocimiento mediante l\u00f3gica de primer orden<\/a>.\n<\/li>\n
        26. \nA Formal Proof Of The Riesz Representation Theorem<\/a> by A. Narkawicz. #PVS\n<\/li>\n
        27. \nThe limits of correctness<\/a> by B.C. Smith (Reflexiones sobre las demostraciones de correcci\u00f3n de programas).\n<\/li>\n
        28. \nLI2011: Estrategias y refinamiento de resoluci\u00f3n proposicional<\/a>. #L\u00f3gicaComputacional\n<\/li>\n
        29. \nMetodolog\u00eda de la ense\u00f1anza de la programaci\u00f3n funcional en primer curso de la Univeridad de Carnegie Mellon<\/a>.\n<\/li>\n
        30. \nLI2011: Resoluci\u00f3n proposicional<\/a>. #L\u00f3gica\n<\/li>\n
        31. \nEntrevista con H. Hauser \u00abLos matem\u00e1ticos no buscan resultados, van tras la belleza\u00bb<\/a>. #Matem\u00e1ticas\n<\/li>\n
        32. \nWikiproofs<\/a> (Primer wiki de matem\u00e1ticas autoverificadas). #Matem\u00e1ticas #Formalizacion\n<\/li>\n
        33. \nI1M2010: Ejercicios sobre la implementaci\u00f3n en Haskell del TAD de grafos mediante listas<\/a>.\n<\/li>\n
        34. \nI1M2010: Examen de programaci\u00f3n en Haskell<\/a>.\n<\/li>\n
        35. \nLogic in Action<\/a>. #LibroLibre #L\u00f3gica #Computaci\u00f3n\n<\/li>\n
        36. \nReasoned Programming<\/a> de K. Broda, S. Eisenbach y H. Khoshnevisan. #LibroLibre #L\u00f3gica #Programacion\n<\/li>\n
        37. \nStructure and Interpretation of Computer Programs<\/a> en formato ePub. #LibroLibre\n<\/li>\n
        38. \nTimeline of computer science<\/a>. (v\u00eda The Blog of Scott Aaronson)\n<\/li>\n
        39. \nHaskell for the cloud<\/a> por Jeff Epstein, Andrew Black y Simon Peyton Jones.\n<\/li>\n
        40. \nHow To Read A Mathematics Textbook<\/a>.\n<\/li>\n
        41. \nCoq’Art: The Calculus of Inductive Constructions<\/a> por Y. Bertot y P. Cast\u00e9ran. #LibroLibre\n<\/li>\n
        42. \nLogic for Computer Science: Foundations of Automatic Theorem Proving<\/a> por Jean Gallier #LibroLibre #L\u00f3gica #Matem\u00e1ticas\n<\/li>\n
        43. \nBook of Proof<\/a>. #LibroLibre #L\u00f3gica #Matem\u00e1tica\n<\/li>\n
        44. \nThe Programming Historian<\/a> (programaci\u00f3n para historiadores). #LibroLibre\n<\/li>\n
        45. \nVestigium: TAD de las tablas en Haskell<\/a>\n<\/li>\n
        46. \nFormalizaci\u00f3n del lenguaje de programaci\u00f3n C en HOL, Isabelle y Coq<\/a>.\n<\/li>\n
        47. \nSymbolic Logic. An Accessible Introduction to Serious Mathematical Logic<\/a>. #LibroLibre\n<\/li>\n
        48. \nI1M2010: Las tablas (arrays) en #Haskell<\/a>.\n<\/li>\n
        49. \nI1M2010: Implementaci\u00f3n en #Haskell de las colas de prioridad mediante mont\u00edculos<\/a>.\n<\/li>\n
        50. \nApplications of Answer Set Programming in Phylogenetic Systematics<\/a> #EComplexCity #ASP\n<\/li>\n
        51. \nSoftware matem\u00e1tico libre<\/a>. #Matem\u00e1ticas\n<\/li>\n
        52. \nExperience Report: Functional Programming through Deep Time (Modeling the first complex ecosystems on Earth)<\/a>. #Haskell\n<\/li>\n
        53. \nLI2011: Formales normales conjuntivas y disyuntivas<\/a>.\n<\/li>\n
        54. \nIntroductory Computer Science Education at Carnegie Mellon University: A Deans\u2019 Perspective<\/a>.\n<\/li>\n
        55. \nLI2011: Ejercicios de deducci\u00f3n natural proposicional<\/a>.\n<\/li>\n
        56. \nI1M2010: El tipo abstracto de datos de los mont\u00edculos en Haskell<\/a>.\n<\/li>\n
        57. \nI1M2010: El tipo abstracto de datos de las colas de prioridad en Haskell<\/a>.\n<\/li>\n
        58. \nLI2011: Tableros sem\u00e1nticos proposicionales<\/a>.\n<\/li>\n
        59. \nLI2011: Deducci\u00f3n natural en l\u00f3gica proposicional (2)<\/a>.\n<\/li>\n
        60. \nSoluci\u00f3n espa\u00f1ola para un problema de John Nash<\/a>. #Matem\u00e1ticas\n<\/li>\n
        61. \nHaskell como el lenguaje de programaci\u00f3n para los problemas dif\u00edciles<\/a>.\n<\/li>\n
        62. \nI1M2010: El tipo abstracto de datos de las colas en Haskell<\/a>.\n<\/li>\n
        63. \nI1M2010: El tipo abstracto de datos de las pilas en Haskell<\/a>.\n<\/li>\n
        64. \nHaskell And The Social Web<\/a>.\n<\/li>\n
        65. \nFunctional Priority Queues<\/a>. #Haskell\n<\/li>\n
        66. \nA Modern SAT Solver in Haskell<\/a>.\n<\/li>\n
        67. \nDAO2011: Isabelle como un lenguaje funcional<\/a>.\n<\/li>\n
        68. \nAn Interview With Edsger W. Dijkstra<\/a>. #Matem\u00e1ticas #Computaci\u00f3n #Programacion\n<\/li>\n
        69. \nI1M2010: Los problemas de las reinas y de Hamming en Haskell<\/a>\n<\/li>\n
        70. \nLa autorreferencia en la demostraci\u00f3n de G\u00f6del (Parte 3)<\/a> por Gustavo Pi\u00f1eiro. #Matem\u00e1ticas #L\u00f3gica #Godel\n<\/li>\n
        71. \nFormalising, improving, and reusing the Java Module System<\/a>. #Tesis #Isabelle\n<\/li>\n
        72. \nLI2011: Deducci\u00f3n natural en l\u00f3gica proposicional (1)<\/a>.\n<\/li>\n
        73. \nA Formalization of Polytime Functions<\/a>. #Coq\n<\/li>\n<\/ol>\n

          Febrero 2011<\/h2>\n
            \n
          1. \nSoftware Verification turns maintstream<\/a>.\n<\/li>\n
          2. \nComputational Logic in Plain English<\/a> by L.C. Paulson.\n<\/li>\n
          3. \nEntrevista con Donald Knuth<\/a>.\n<\/li>\n
          4. \nSobre el algoritmo de Google<\/a>.\n<\/li>\n
          5. \nResultados recientes sobre el problema de la suma de ra\u00edces cuadradas<\/a>. #Matem\u00e1ticas #Computaci\u00f3n\n<\/li>\n
          6. \nLI2011: Sem\u00e1ntica de la l\u00f3gica proposicional (2)<\/a>.\n<\/li>\n
          7. \nDAO2011: Panorama del razonamiento autom\u00e1tico a trav\u00e9s de ejemplos en Prover9, ACL2, PVS e Isabelle<\/a>.\n<\/li>\n
          8. \nInterval Temporal Logic on Natural Numbers<\/a>. #Isabelle\n<\/li>\n
          9. \nInfinite Lists<\/a> por David Trachtenherz. #Isabelle\n<\/li>\n
          10. \nI1M2010: Problema del concurso \u201cCifras y letras\u201d en #Haskell (2)<\/a>.\n<\/li>\n
          11. \nWas Cantor Surprised?<\/a>. (RT @BenVitale)\n<\/li>\n
          12. \nI1M2010: Ejercicios de demostraciones de propiedades de funciones Haskell (relaci\u00f3n 20)<\/a>. #Matem\u00e1ticas\n<\/li>\n
          13. \nI1M2010: Ejercicios de c\u00e1lculo num\u00e9rico en Haskell (relaci\u00f3n 19)<\/a>.\n<\/li>\n
          14. \nThe Depth Of The M\u00f6bius Function (A striking connection between complexity theory and the number theory)<\/a>.\n<\/li>\n
          15. \nArtificial Intelligence (Foundations of Computational Agents)<\/a>. #LibroLibre #InteligenciaArtificial\n<\/li>\n
          16. \nRA2010: Panorama del razonamiento autom\u00e1tico con Isabelle\/HOL<\/a>.\n<\/li>\n
          17. \n[[http:\/\/goo.gl\/niD8K][LI2011: Sem\u00e1ntica de la l\u00f3gica proposicional (1)].\n<\/li>\n
          18. \nMathematical Reasoning and Proof with Puzzles, Patterns, and Games.<\/a> (via @adolfont)\n<\/li>\n
          19. \nIBM Watson’s win at Jeopardy! is also a success story for Prolog<\/a>.\n<\/li>\n
          20. \nWittgenstein for programmers<\/a>.\n<\/li>\n
          21. \nMathematical Paradoxes and Sophisms<\/a>. #Matem\u00e1ticas #L\u00f3gica\n<\/li>\n
          22. \nEl tao de la programaci\u00f3n<\/a>. #LibroLibre\n<\/li>\n
          23. \nTractatus Digito-Philosophicus<\/a> #Filosofia #Computaci\u00f3n\n<\/li>\n
          24. \nAre Mathematicians In Jeopardy?<\/a>. #IA\n<\/li>\n
          25. \nOn proof and progress in mathematics<\/a>. #Matem\u00e1ticas\n<\/li>\n
          26. \nWhy is is so difficult to write complete (computer verifiable) proofs?<\/a>.\n<\/li>\n
          27. \nLI2011: La l\u00f3gica proposicional como sistema de representaci\u00f3n del conocimiento y su sintaxis<\/a>.\n<\/li>\n
          28. \nVestigium: Problema del concurso \u201cCifras y letras\u201d en #Haskell<\/a>.\n<\/li>\n
          29. \nVestigium: Razonamiento sobre programas<\/a>. #Haskell #L\u00f3gicaComputacional\n<\/li>\n
          30. \nVestigium: Ejercicios de Haskell (relaciones 16, 17 y 18)<\/a>. #Haskell\n<\/li>\n
          31. \nVestigium: Presentaci\u00f3n del curso de \u201cL\u00f3gica Inform\u00e1tica\u201d<\/a>. #L\u00f3gicaComputacional\n<\/li>\n
          32. \nVestigium: Demostraci\u00f3n con Isabelle de la correcci\u00f3n de un compilador<\/a>. #RazonamientoFormalizado\n<\/li>\n
          33. \nEntrevista con C\u00e8dric Villani ganador de la medalla Fields 2010<\/a>. #Matem\u00e1ticas\n<\/li>\n
          34. \nLa irresistible elegancia de un teorema<\/a> por Guillermo Mart\u00ednez.\n<\/li>\n
          35. \nTutorial sobre el desarrollo en Haskell de aplicaciones para el iPhone<\/a>.\n<\/li>\n
          36. \nLower Semicontinuous Functions<\/a>. #Isabelle\n<\/li>\n
          37. \nFunctional Binomial Queues<\/a>. #Isabelle\n<\/li>\n
          38. \nHow to Write a Proof<\/a> por Lesli Lamport.\n<\/li>\n
          39. \nComplementary validation<\/a>\n<\/li>\n
          40. \nCronolog\u00eda de la ciencia de la computaci\u00f3n<\/a> #Computaci\u00f3n\n<\/li>\n
          41. \nFormalization of Psychological Knowledge in Answer Set Programming and its Application<\/a>. #ASP\n<\/li>\n
          42. \nCharming Proofs: A Journey Into Elegant Mathematics<\/a>. #LibroLibre #Matem\u00e1ticas\n<\/li>\n
          43. \nVestigium: \u201cEl pr\u00f3ximo despu\u00e9s de 1811\u2033 con Haskell<\/a>\n<\/li>\n
          44. \nRA2010: Ejercicios de razonamiento sobre listas en Isabelle\/Isar<\/a>. #RazonamientoFormalizado\n<\/li>\n
          45. \nVestigium: Wiki de ejercicios de razonamiento formalizado en Isabelle\/Isar<\/a>. #RazonamientoFormalizado\n<\/li>\n
          46. \nVestigium: El tipo abstracto de datos de las colas de prioridad en Haskell.<\/a>\n<\/li>\n
          47. \nA novel formalization of symbolic trajectory evaluation semantics in Isabelle\/HOL<\/a>. #RazonamientoFormalizado\n<\/li>\n
          48. \nGame Changing Conjectures In Mathematics<\/a>.\n<\/li>\n
          49. \nCarta ficticia de Arist\u00f3teles a Plat\u00f3n sobre l\u00f3gica computacional<\/a>.\n<\/li>\n
          50. \nIntelligent Semantic Web Search Engines: A Brief Survey<\/a>. #WebSem\u00e1ntica\n<\/li>\n
          51. \nWhat Is Artificial Intelligence?<\/a> en NYTimes #InteligenciaArtificial\n<\/li>\n
          52. \nRobotEarth: una Internet para robots<\/a>. #InteligenciaArtificial\n<\/li>\n
          53. \nEl juego de “Super Nario Bros” en #Haskell<\/a>.\n<\/li>\n
          54. \nCurso de Shankar de introducci\u00f3n a la verificaci\u00f3n formal con PVS.<\/a>\n<\/li>\n
          55. \nFormalizaci\u00f3n en Isabelle\/Isar del algoritmo de Euclides<\/a>.\n<\/li>\n
          56. \nAn Overview of QML With a Concrete Implementation in Haskell<\/a>.\n<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"

            Esta entrada es una recopilaci\u00f3n de lecturas que he compartido en Twitter. La recopilaci\u00f3n de los tweets est\u00e1 ordenada seg\u00fan la fecha de su publicaci\u00f3n en Twitter.<\/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\/1440"}],"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=1440"}],"version-history":[{"count":11,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/1440\/revisions"}],"predecessor-version":[{"id":1553,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/1440\/revisions\/1553"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=1440"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=1440"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=1440"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}