{"id":6065,"date":"2017-12-01T12:35:16","date_gmt":"2017-12-01T11:35:16","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=6065"},"modified":"2018-07-10T10:08:44","modified_gmt":"2018-07-10T08:08:44","slug":"resumen-de-lecturas-compartidas-durante-noviembre-de-2017","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/resumen-de-lecturas-compartidas-durante-noviembre-de-2017\/","title":{"rendered":"Resumen de lecturas compartidas (noviembre de 2017)"},"content":{"rendered":"<div id=\"content\">Esta entrada es una recopilaci\u00f3n de lecturas compartidas, durante noviembre de 2017, en <a href=\"https:\/\/twitter.com\/Jose_A_Alonso\">Twitter<\/a> sobre programaci\u00f3n funcional y demostraci\u00f3n asistida por ordenador.<\/div>\n<p>Las lecturas est\u00e1n ordenadas seg\u00fan su fecha de publicaci\u00f3n en <a href=\"https:\/\/twitter.com\/Jose_A_Alonso\">Twitter<\/a>.<\/p>\n<p>Al final de cada art\u00edculo se encuentran etiquetas relativas a los sistemas que usa o a su contenido.<br \/>\n<!--more--><\/p>\n<div>\n<ul>\n<li><a href=\"https:\/\/galois.com\/blog\/2017\/10\/formal-methods-krack-vulnerability\">Formal methods and the KRACK vulnerability<\/a>. ~ Joey Dodds #Cryptography #Formal_methods<\/li>\n<li><a href=\"http:\/\/pcgbook.com\/wp-content\/uploads\/chapter08.pdf\">ASP with applications to mazes and levels<\/a>. ~ Mark J. Nelson &amp; Adam M. Smith @rndmcnlly #ASP #Game<\/li>\n<li><a href=\"http:\/\/www.cs.cmu.edu\/~cmartens\/asp-notes.pdf\">Notes on Answer Set Programming<\/a>. ~ Chris Martens #ASP #Logic Programming<\/li>\n<li><a href=\"https:\/\/thelazydev.net\/blog\/post\/the-basics-of-answer-set-programming\">The basics of Answer Set Programming<\/a>. ~ Olaf Aviss #ASP<\/li>\n<li><a href=\"http:\/\/www.hakank.org\/constraint_programming_blog\/2010\/12\/a_first_look_at_answer_set_programming.html\">A first look at Answer Set Programming<\/a>. ~ Hakan Kjellerstrand (@hakankj) #ASP<\/li>\n<li><a href=\"http:\/\/picat-lang.org\/picatbook2015.html\">Constraint solving and planning with Picat<\/a>. ~ N.F. Zhou, H. Kjellerstrand, J. Fruhman #eBook #Logic #Programming #Picat<\/li>\n<li><a href=\"https:\/\/bioasp.github.io\/\">BioASP: Answer Set Programming for systems biology<\/a>. #ASP<\/li>\n<li><a href=\"https:\/\/www.cs.us.es\/~jalonso\/apuntes\/Categorias_y_programacion\/Categorias_y_programacion.html\">Lecturas de teor\u00edas de categor\u00edas y programaci\u00f3n funcional<\/a>. #Matem\u00e1ticas #Programaci\u00f3n<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/numeros-libres-de-cuadrados-2\">Exercitium: N\u00fameros libres de cuadrados<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1710.11204\">Improve SAT-solving with machine learning<\/a>. ~ Haoze Wu #ATP #SAT #ML<\/li>\n<li><a href=\"https:\/\/github.com\/GU-CLASP\/TypedFlow\">TypedFlow: a typed, higher-order frontend to TensorFlow and a high-level library for deep-learning<\/a>. ~ Jean-Philippe Bernardy #Haskell #DeepLearning<\/li>\n<li><a href=\"http:\/\/online.liebertpub.com\/doi\/pdf\/10.1089\/ees.2016.0223\">Academic research in the 21st century: maintaining scientific integrity in a climate of perverse incentives and hypercompetition<\/a>. ~ M.A. Edwards, S. Roy<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/ra2017-ejercicios-de-programacion-funcional-con-isabellehol\/\">RA2017: Ejercicios de programaci\u00f3n funcional con Isabelle\/HOL<\/a>. #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/ra2017-razonamiento-automatico-sobre-programas-en-isabellehol\">RA2017: Razonamiento autom\u00e1tico sobre programas en Isabelle\/HOL<\/a>. #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-funciones-de-orden-superior-en-haskell\">I1M2017: Funciones de orden superior en Haskell<\/a>. #Haskell<\/li>\n<li><a href=\"http:\/\/neilmitchell.blogspot.com\/2017\/11\/understanding-hlint-rules.html\">Understanding HLint rules<\/a>. ~ Neil Mitchell #Haskell<\/li>\n<li><a href=\"http:\/\/gelisam.blogspot.com.es\/2017\/11\/computing-with-impossible-types.html\">Computing with impossible types<\/a>. ~ @haskell_cat #Haskell<\/li>\n<li><a href=\"https:\/\/byorgey.wordpress.com\/2017\/11\/03\/sum-of-heights-in-a-binary-tree\">Sum of heights in a binary tree<\/a>. ~ Brent Yorgey #Algorithmic<\/li>\n<li><a href=\"http:\/\/aivikasoft.com\/downloads\/aivika\/aivika.pdf\">Aivika: computation-based modeling and simulation in Haskell<\/a>. ~ David E. Sorokin et als. #eBook #Haskell #Simulation<\/li>\n<li><a href=\"https:\/\/github.com\/rpeszek\/notes-milewski-ctfp-hs\">Notes and thoughts from reading Milewski &#8220;Category theory for programmers&#8221; written in Haskell<\/a>. ~ Robert Peszek #Haskell #Category_theory<\/li>\n<li><a href=\"http:\/\/orca-mwe.cf.ac.uk\/105921\/2\/main.pdf\">Foundations of implementations for formal argumentation<\/a>. ~ F. Cerutti et als. #Logic #AI #ASP<\/li>\n<li><a href=\"http:\/\/logicaltypes.blogspot.com\/2017\/10\/october-2017-1haskelladay-problems-and.html\">October 2017 1HaskellADay problems and solutions<\/a>. ~ Douglas M. Auclair (@geophf) | Typed Logic #Haskell #1HaskellADay<\/li>\n<li><a href=\"https:\/\/github.com\/jaalonso\/Lecturas_GLC#octubre-2017\">GLC: Lista de lecturas compartidas en octubre de 2017<\/a>.<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/numeros-completos\">Exercitium: N\u00fameros completos<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/blockstream.com\/simplicity.pdf\">Simplicity: a new language for blockchains<\/a>. ~ Russell O\u2019Connor #Coq #Blockchain<\/li>\n<li><a href=\"http:\/\/www.abc.es\/ciencia\/abci-matematicas-puede-esconder-donut-201711031107_noticia.html\">Las matem\u00e1ticas que puede esconder un d\u00f3nut<\/a>. ~ Alfonso J. Poblaci\u00f3n #Matem\u00e1ticas<\/li>\n<li><a href=\"https:\/\/medium.com\/q-e-d\/who-gets-to-be-called-a-mathematician-15f73f2d0e5d\">Who gets to be called a mathematician?<\/a> ~ Junaid Mubeen (@fjmubeen) #Math<\/li>\n<li><a href=\"http:\/\/bit.ly\/2zkfIPP\">A set solver for finite relation algebra<\/a>. ~ M. Cristi\u00e1, G. Rossi #CLP<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/primos-equidistantes-2\">Exercitium: Primos equidistantes<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/github.com\/BartoszMilewski\/Publications\/raw\/master\/ProfunctorOptics-LambdaWorld2017.pdf\">Profunctor Optics<\/a>. ~ Bartosz Milewski (@BartoszMilewski) #Haskell<\/li>\n<li><a href=\"https:\/\/bitbucket.org\/prl_tokyo\/bigul\">BiGUL: the bidirectional generic update language<\/a>. #Haskell #Agda<\/li>\n<li><a href=\"https:\/\/bitbucket.org\/prl_tokyo\/bigul\/raw\/logic\/POPL18\/logic.pdf\">An axiomatic basis for bidirectional programming<\/a>. ~ H.S. Ko, Z. Hu #Agda<\/li>\n<li><a href=\"https:\/\/josh-hs-ko.github.io\/Agda\/POPL18\/Everything.html\">An axiomatic basis for bidirectional programming (Agda code)<\/a>. ~ H.S. Ko, Z. Hu #Agda<\/li>\n<li><a href=\"http:\/\/iris-project.org\/pdfs\/2018-popl-runST-submission.pdf\">A logical relation for monadic encapsulation of state (Proving contextual equivalences in the presence of runST)<\/a>. ~ A. Timany #Haskell<\/li>\n<li><a href=\"http:\/\/www.eldiario.es\/cultura\/tecnologia\/AutoML-maquina-crea-maquinas-inteligentes_0_705179666.html\">AutoML, la m\u00e1quina que crea otras m\u00e1quinas inteligentes<\/a>. ~ David Sarabia (@DSRELD) #IA #AA<\/li>\n<li><a href=\"https:\/\/research.googleblog.com\/2017\/11\/automl-for-large-scale-image.html\">AutoML for large scale image classification and object detection<\/a>. ~ B. Zoph, V. Vasudevan, J. Shlens, Q. Le #AI #ML<\/li>\n<li><a href=\"https:\/\/medium.com\/q-e-d\/is-mathematics-a-fine-art-5feede2a8f5e\">Is mathematics a fine art?<\/a> ~ Adrian Hindes #Math<\/li>\n<li><a href=\"https:\/\/www.nytimes.com\/2017\/08\/13\/technology\/artificial-intelligence-safety-training.html\">Teaching A.I. systems to behave themselves<\/a>. ~ Cade Metz #AI #ML<\/li>\n<li><a href=\"https:\/\/www.quantamagazine.org\/mathematicians-measure-infinities-find-theyre-equal-20170912\">Mathematicians measure infinities and find they\u2019re equal<\/a>. ~ Kevin Hartnett (@KSHartnett) #Math via @QuantaMagazine<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/producto-cartesiano-de-una-familia-de-conjuntos\">Exercitium: Producto cartesiano de una familia de conjuntos<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/nikivazou.github.io\/static\/popl18\/refinement-reflection.pdf\">Refinement reflection: complete verification with SMT<\/a>. ~ Niki Vazou (@nikivazou) #Haskell #LiquidHaskell #Logic #SMT<\/li>\n<li><a href=\"https:\/\/functional.works-hub.com\/blog\/Persistent-Red-Black-Trees-in-Haskell?utm_campaign=Edmund&amp;utm_content=62649506\">Persistent red black trees in Haskell<\/a>. ~ Abhiroop Sarkar #Haskell<\/li>\n<li><a href=\"http:\/\/www.cs.nott.ac.uk\/~pszgmh\/improving.pdf\">Improving Haskell<\/a>. ~ Martin A.T. Handley &amp; Graham Hutton #Haskell<\/li>\n<li><a href=\"https:\/\/github.com\/mathandley\/Unie\">Unie: Inequational reasoning assistant for proofs relating to improvement theory<\/a>. ~ Martin A.T. Handley #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-codificacion-binaria-y-transmision-de-cadenas-en-haskell\">I1M2017: Codificaci\u00f3n binaria y transmisi\u00f3n de cadenas en Haskell<\/a>. #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-operaciones-conjuntistas-con-listas\">I1M2017: Operaciones conjuntistas con listas<\/a>. #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/biparticiones-de-un-numero\">Exercitium: Biparticiones de un n\u00famero<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/www.cis.upenn.edu\/~llamp\/pdf\/GeneratingGoodGenerators.pdf\">Generating good generators for inductive relations<\/a>. ~ L. Lampropoulos, Z. Paraskevopoulou, B.C. Pierce #Coq #QuickCheck<\/li>\n<li><a href=\"http:\/\/www.cse.chalmers.se\/~russo\/publications_files\/plas2017.pdf\">Encoding DCC (Dependency Core Calculus) in Haskell<\/a>. ~ M. Algehed &amp; A. Russo #Haskell<\/li>\n<li><a href=\"https:\/\/elpais.com\/elpais\/2017\/11\/08\/el_aleph\/1510158827_253966.amp.html\">C\u00f3mo calcular \u00e1reas contando puntitos<\/a>. ~ M.A. Morales @gaussianos | El Aleph #Matem\u00e1ticas<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.01477\">An introduction to univalent foundations for mathematicians<\/a>. ~ D.R. Grayson #Math #Logic #HoTT<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.01994\">Proof theory<\/a>. ~ J. Avigad #Math #Logic #ATP<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.02120\">Small resolution proofs for QBF using dependency treewidth<\/a>. ~ E. Eiben, R. Ganian &amp; S. Ordyniak #Math #Logic #ATP<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1710.10385\">Capturing the future by replaying the past (Functional Pearl)<\/a>. ~ J. Koppel &amp; A. Solar #SML<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/numeros-libres-de-cuadrados-2\/\">Exercitium: &#8220;N\u00fameros_libres de cuadrados&#8221;<\/a>. #Haskell #I1M2017 #I1M2017<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-definiciones-de-tipos-en-haskell\/\">I1M2017: Definiciones de tipos en Haskell<\/a>. #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/2zyZrGG\">Finite state machines? (Your compiler wants in!)<\/a> ~ Oskar Wickstr\u00f6m (@owickstrom) #Haskell #Idris<\/li>\n<li><a href=\"http:\/\/tpetricek.github.io\/Talks\/2017\/aliens-lambda-calculus\/codemesh\">Would aliens understand lambda calculus?<\/a> ~ Tomas Petricek (@tomaspetricek) #Math #Logic #CompSci<\/li>\n<li><a href=\"https:\/\/youtu.be\/GMm_AGbgWv0\">Verifiable computing in Haskell<\/a>. ~ Anthony Sheldon #Haskell #Math<\/li>\n<li><a href=\"https:\/\/cgi.csc.liv.ac.uk\/~slk\/drafts\/safety_isabelle_ifm2017.pdf\">Spatial reasoning about motorway traffic safety with Isabelle\/HOL<\/a>. ~ Sven Linker #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/browser_info\/current\/AFP\/Hybrid_Multi_Lane_Spatial_Logic\/document.pdf\">Hybrid multi-lane spatial logic in Isabelle\/HOL<\/a>. ~ Sven Linker #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/patternsinfp.wordpress.com\/2017\/11\/09\/the-digits-of-pi\">The digits of pi<\/a>. ~ Jeremy Gibbons @jer_gib #Haskell #Math<\/li>\n<li><a href=\"http:\/\/chriswarbo.net\/blog\/2017-11-09-haskell_theory_exploration_scripts.html\">Haskell theory exploration scripts<\/a>. ~ Chris Warburton #Haskell<\/li>\n<li><a href=\"https:\/\/hackernoon.com\/the-has-type-class-pattern-ca12adab70ae\">The Has type class pattern<\/a>. ~ Jonathan Fischoff #Haskell via @topical_hq<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/browser_info\/current\/AFP\/IMAP-CRDT\/document.pdf\">Formalization of a Conflict-free Replicated Datatype for Internet Message Access Protocol commands in Isabelle\/HOL<\/a>. ~ T. Jungnickel, L. Oldenburg &amp; M. Loibl #IsabelleHOL<\/li>\n<li><a href=\"http:\/\/publications.lib.chalmers.se\/records\/fulltext\/252478\/252478.pdf\">Theory exploration on infinite structures<\/a>. ~ S.H. Einarsd\u00f3ttir #IsabelleHOL<\/li>\n<li><a href=\"http:\/\/blairarchibald.co.uk\/resources\/papers\/jpdc-preprint-2017.pdf\">Replicable parallel branch and bound search<\/a>. ~ B. Archibald, P. Maier, C. McCreesh, R. Stewart &amp; P. Trinder #Haskell<\/li>\n<li><a href=\"https:\/\/github.com\/alpacaaa\/elm-to-purescript-cheatsheet\">Purescript for Elm developers<\/a>. ~ Marco Sampellegrini (@_alpacaaa) #PureScript #Elm<\/li>\n<li><a href=\"http:\/\/www.dc.fi.udc.es\/~cabalar\/logicalASP.pdf\">Answer Set Programming from a logical point of view<\/a>. ~ P. Cabalar, D. Pearce &amp; A. Valverde #ASP<\/li>\n<li><a href=\"http:\/\/www.glass-bead.org\/article\/glass-bead-conversation-catarina-dutch-novaes-reviel-netz\">Formalisms and formalizations: Glass Bead in conversation with Catarina Dutilh Novaes and Reviel Netz<\/a>. #Logic #Math via @cdutilhnovaes<\/li>\n<li><a href=\"https:\/\/www.quantamagazine.org\/to-settle-infinity-question-a-new-law-of-mathematics-20131126\">To settle infinity question, a new law of Mathematics<\/a>. ~ Natalie Wolchover (@nattyover) #Math via @QuantaMagazine<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.00678\">Scientists in silico?<\/a> ~ Carl McBride #CompSci<\/li>\n<li><a href=\"http:\/\/argumentationcompetition.org\/2017\/argmat-clpb.pdf\">argmat-clpb: Solve argumentation problems using Constraint Logic Programming over boolean variables<\/a>. ~ F. Pu, G. Luo &amp; Y. Chen #CLP<\/li>\n<li><a href=\"http:\/\/bit.ly\/2hmhqG4\">Vigila tus primos<\/a>. ~ Juan Arias de Reyna #Matem\u00e1ticas #Computaci\u00f3n #RSA<\/li>\n<li><a href=\"http:\/\/www.eldiario.es\/cultura\/privacidad\/entender-Gobierno-desactivado-DNI-electronico_0_706229708.html\">Cinco claves para entender por qu\u00e9 el Gobierno ha desactivado tu DNI electr\u00f3nico<\/a>. ~ David Sarabia (@DSRELD) #RSA<\/li>\n<li><a href=\"https:\/\/arstechnica.com\/information-technology\/2017\/10\/crypto-failure-cripples-millions-of-high-security-keys-750k-estonian-ids\/\">Millions of high-security crypto keys crippled by newly discovered flaw (Factorization weakness lets attackers impersonate key holders and decrypt their data)<\/a>. ~ Dan Goodin (@dangoodin001) #RSA<\/li>\n<li><a href=\"https:\/\/acmccs.github.io\/papers\/p1631-nemecA.pdf\">The return of Coppersmith\u2019s attack: Practical factorization of widely used RSA moduli<\/a>. ~ M. Nemec, M. Sys, P. Svenda, D. Klinec, V. Matyas #Math #CompSci #RSA<\/li>\n<li><a href=\"https:\/\/vrahli.github.io\/articles\/continuity-journal-mscs.pdf\">Validating Brouwer&#8217;s continuity principle for numbers using named exceptions<\/a>. ~ V. Rahli &amp; M. Bickford #ITP #Nuprl #Coq<\/li>\n<li><a href=\"https:\/\/github.com\/robstewart57\/dblp2bibtex\">dblp2bibtex: Generates bibtex files for authors identified in the DBLP database<\/a>. ~ Rob Stewart (@robstewartUK) #Haskell #TeX<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/numeros-completos\">Exercitium: &#8220;N\u00fameros completos&#8221;<\/a> #Haskell #I1M2017<\/li>\n<li><a href=\"http:\/\/xion.io\/post\/programming\/rust-into-haskell.html\">Rust as a gateway drug to Haskell<\/a>. ~ Karol Kuczmarski (@Xion__) #Rust #Haskell via @topical_hq<\/li>\n<li><a href=\"http:\/\/www.cse.chalmers.se\/~vassena\/publications_files\/jlamp2018.pdf\">MAC (A verified static information-flow control library)<\/a>. ~ M. Vassena &amp; A. Russo #Haskell #Agda<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/primos-equidistantes-2\">Exercitium: &#8220;Primos consecutivos equidistantes&#8221;<\/a> #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/alpacaaa.net\/blog\/post\/elm-purescript-in-depth-overview\">In depth overview of Elm and PureScript. Lessons learned porting a game from PureScript to Elm<\/a>. ~ Marco Sampellegrini (@_alpacaaa) #PureScript #Elm<\/li>\n<li><a href=\"http:\/\/mutanatum.com\/posts\/2017-01-12-Browser-FP-Head-to-Head.html\">Selecting a platform: JavaScript vs Elm vs PureScript vs GHCjs vs Scalajs<\/a>. ~ Isaac Shapira #JavaScript #Elm #PureScript #GHCjs #Scalajs<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/producto-cartesiano-de-una-familia-de-conjuntos\">Exercitium: &#8220;Producto cartesiano de una familia de conjuntos&#8221;<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"http:\/\/scholarship.claremont.edu\/cgi\/viewcontent.cgi?article=1006&amp;context=jhm\">Is (some) mathematics poetry?<\/a> ~ J. Henle #Math<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.03902\">Neural-symbolic learning and reasoning: a survey and interpretation<\/a>. ~ T.R. Besold et als. #AI<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/biparticiones-de-un-numero\">Exercitium: &#8220;Biparticiones de un n\u00famero&#8221;<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/www.haskell.org\/communities\/11-2017\/html\/report.html\">Haskell communities and activities report (November 2017)<\/a>. #Haskell<\/li>\n<li><a href=\"http:\/\/bit.ly\/2zIjQcK\">Por qu\u00e9 deber\u00edas aprender programaci\u00f3n funcional ya mismo (con una breve introducci\u00f3n a Haskell)<\/a>. ~ A. Marzal #PF #Haskell<\/li>\n<li><a href=\"http:\/\/ceur-ws.org\/Vol-1145\/tutorial1.pdf\">Answer Set Programming and CLASP (A tutorial)<\/a>. ~ S. H\u00f6lldobler, L. Schweizer #ASP<\/li>\n<li><a href=\"http:\/\/www.tweag.io\/posts\/2017-11-16-repa.html\">Parallelising your array code<\/a>. ~ Manuel Chakravarty (@TacticalGrace) #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/pares-definidos-por-su-mcd-y-su-mcm\">Exercitium: &#8220;Pares definidos por su MCD y su MCM&#8221;<\/a>. #Haskell #I1M2017 #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/babel.hathitrust.org\/cgi\/pt?id=wu.89055052690;view=1up;seq=13\">Portraits of famous philosophers who were also famous mathematicians<\/a>. ~ C.S. Keyser #eBook #Math #History<\/li>\n<li><a href=\"https:\/\/github.com\/sergv\/kievfprog-2017-november\/raw\/master\/Talk.pdf\">Recursion schemes (why, how and more)<\/a>. ~ Sergey Vinokurov (@5ergv) #Haskell<\/li>\n<li><a href=\"https:\/\/github.com\/DSLsofMath\/DSLsofMath\/raw\/master\/L\/snapshots\/DSLsofMathNotes_2017-11-08.pdf\">Domain Specific Languages of Mathematics: lecture notes (November 8, 2017)<\/a>. ~ Patrik Jansson (@patrikja), Cezar Ionescu. #Haskell #Math<\/li>\n<li><a href=\"https:\/\/infoscience.epfl.ch\/record\/232405\/files\/EPFL_TH7885.pdf\">Algorithmic resource verification<\/a>. ~ R Kandhadai Madhavan #PhD_Thesis #ITP #Leon<\/li>\n<li><a href=\"http:\/\/ratiolog.uni-koblenz.de\/proceedings2017.pdf#page=35\">Proceedings of the Third Workshop on Bridging the gap between human and automated Reasoning (Is logic and automated reasoning a foundation for human reasoning?)<\/a> #Logic #AR<\/li>\n<li><a href=\"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3133929&amp;type=pdf\">How type errors were fixed and what students did?<\/a> ~ B. Wu, S. Chen #Haskell<\/li>\n<li><a href=\"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3133930&amp;type=pdf\">Learning user friendly type-error messages<\/a>. ~ B. Wu, J.P. Campora III, S. Chen #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-resolucion-de-problemas-y-el-metodo-de-polya\">I1M2017: Resoluci\u00f3n de problemas y el m\u00e9todo de Polya<\/a>. #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-programacion-con-haskell-en-la-red-usando-repl-it\">I1M2017: Programaci\u00f3n con Haskell en la Red usando Repl.it<\/a>. #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-ejercicios-sobre-arboles-binarios-en-haskell-1\">I1M2017: Ejercicios sobre \u00e1rboles binarios en Haskell (1)<\/a>. #Haskell<\/li>\n<li><a href=\"http:\/\/www.cs.us.es\/~jalonso\/cursos\/i1m\/ejercicios\/ejercicios-I1M-2017.pdf\">I1M2017: Libro con las soluciones de las 8 primeras relaciones de ejercicios de programaci\u00f3n con Haskell<\/a>. #Haskell<\/li>\n<li><a href=\"https:\/\/github.com\/sergv\/kievfprog2015\/raw\/master\/talk.pdf\">Unifying parsing and prettyprinting<\/a>. ~ Sergey Vinokurov (@5ergv) #Haskell<\/li>\n<li><a href=\"http:\/\/blog.higher-order.com\/assets\/AdjunctionsSbtBExtended.pdf\">Adjunctions in everyday life (What we talk about when we talk about monads)<\/a>. ~ R\u00fanar Bjarnason (@runarorama) #Haskell<\/li>\n<li><a href=\"http:\/\/git.io\/fp-jargons\">Jargon from the functional programming world in simple terms!<\/a> #FuncionalProgramming<\/li>\n<li><a href=\"https:\/\/github.com\/ikhoon\/functional-programming-jargon.scala\/tree\/master\/tut\">Scala code examples for functional programming jargon<\/a>. ~ Ikhoon Eom #FuncionalProgramming #Scala<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.06542\">Mechanizing Principia Logico-Metaphysica in functional type theory<\/a>. ~ D. Kirchner, C. Benzm\u00fcller, E.N. Zalta #IsabelleHOL #RA2017<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/browser_info\/current\/AFP\/PLM\/document.pdf\">Representation and partial automation of the Principia Logico-Metaphysica in Isabelle\/HOL<\/a>. ~ D. Kirchner #Msc_Thesis #IsabelleHOL #RA2017<\/li>\n<li><a href=\"https:\/\/wickstrom.tech\/finite-state-machines\/2017\/11\/19\/finite-state-machines-part-2.html\">Finite-state machines, part 2: Explicit typed state transitions<\/a>. ~ Oskar Wickstr\u00f6m (@owickstrom) #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/numeros-oblongos\">Exercitium: &#8220;N\u00fameros oblongos&#8221;<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/github.com\/sergv\/kievfprog2016\/raw\/master\/Talk.pdf\">Let\u2019s play with Regular Expressions<\/a>. ~ Sergey Vinokurov (@5ergv) #Haskell<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.05814\">Python implementation and construction of finite abelian groups<\/a>. ~ P. Bradley, J. Smethurst #Python #Math<\/li>\n<li><a href=\"http:\/\/www.cs.uni.edu\/~wallingf\/blog\/archives\/monthly\/2017-11.html#e2017-11-15T16_03_52.htm\">A programming digression: Kaprekar numbers<\/a>. ~ E. Wallingford (@wallingf) #Programming #Math<\/li>\n<li><a href=\"https:\/\/github.com\/Juzley\/elm-net\">Net puzzle game in Elm<\/a>. ~ Julian Priestley #Elm #Puzzle<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.07023\">Verification of PCP-related computational reductions in Coq<\/a>. ~ Y. Forster, E. Heiter, G. Smolka #Coq<\/li>\n<li><a href=\"https:\/\/ku-fpg.github.io\/files\/Grebe-17-Transformations.pdf\">Rewriting a shallow DSL using a GHC Compiler extension<\/a>. ~ M. Grebe, D. Young, A. Gill #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/mayor-numero-equidigital\">Exercitium: &#8220;Mayor n\u00famero equidigital&#8221;<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"http:\/\/www.cs.uni.edu\/~wallingf\/blog\/archives\/monthly\/2010-10.html#e2010-10-25T16_50_29.htm\">A programming digression: Farey sequences<\/a>. ~ E. Wallingford (@wallingf) #Programming #Math<\/li>\n<li><a href=\"https:\/\/two-wrongs.com\/emacs-for-humans-glossary\">Emacs for humans: glossary<\/a>. #Emacs<\/li>\n<li><a href=\"https:\/\/www.fpcomplete.com\/blog\/2017\/01\/quickcheck\">QuickCheck and magic of testing<\/a>. ~ A. Kuleshevich #Haskell #QuickCheck<\/li>\n<li><a href=\"http:\/\/www.newthinktank.com\/2017\/11\/emacs-tutorial\">Learn Emacs in one video<\/a>. ~ Derek Banas (@NewThinkTank) #Emacs #I1M2017<\/li>\n<li><a href=\"http:\/\/reasonablypolymorphic.com\/blog\/type-directed-code-generation\">Type-directed code generation<\/a>. ~ Sandy Maguire #Haskell<\/li>\n<li><a href=\"https:\/\/tech-blog.capital-match.com\/posts\/3-anatomy-of-haskell-web-app.html\">Anatomy of a Haskell-based application, revisited<\/a>. ~ Zhouyu Qian (@kccqzy) #Haskell<\/li>\n<li><a href=\"https:\/\/github.com\/rudymatela\/leancheck\">LeanCheck: a simple enumerative property-based testing library<\/a>. ~ Rudy Matela #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/numeros-digito-potenciales\">Exercitium: &#8220;N\u00fameros d\u00edgito potenciales&#8221;<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"http:\/\/www.cs.uni.edu\/~wallingf\/blog\/archives\/monthly\/2015-12.html#e2015-12-08T15_55_44.htm\">A programming digression: Generating excellent numbers<\/a>. ~ E. Wallingford (@wallingf) #Programming #Math<\/li>\n<li><a href=\"https:\/\/www.slideshare.net\/saurabhnanda\/joys-frustrations-of-putting-34000-lines-of-haskell-into-production-at-vacation-labs\">Joys &amp; frustrations of putting 34,000 lines of Haskell into production (at Vacation Labs)<\/a>. ~ Saurabh Nanda (@saurabhnanda) #Haskell<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.08076\">Schur number five<\/a>. ~ Marijn J.H. Heule #SAT #Logic #AI<\/li>\n<li><a href=\"https:\/\/openlibra.com\/es\/book\/category-theory-for-programmers\">Category theory for programmers<\/a>. ~ Bartosz Milewski #eBook #CategoryTheory #Haskell #OpenLibra<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/suma-de-divisores\">Exercitium: &#8220;Suma de divisores&#8221;<\/a>. #Haskell #I1M2017 #I1M2017<\/li>\n<li><a href=\"https:\/\/softwarefoundations.cis.upenn.edu\/vfa-current\/index.html\">Verified functional algorithms<\/a>. ~ Andrew W. Appel #FuncionalProgramming #ITP #Coq<\/li>\n<li><a href=\"https:\/\/rahulmutt.github.io\/slides\/fuconf17-eta-fibers\/slides.html\">Eta Fibers (Towards better concurrency on the JVM)<\/a>. ~ Rahul Muttineni #Haskell<\/li>\n<li><a href=\"http:\/\/www.cs.us.es\/~fsancho\/?e=186\">Resolviendo problemas de satisfacci\u00f3n de restricciones con hormigas<\/a>. ~ F. Sancho @sanchocaparrini #PSR #IA<\/li>\n<li><a href=\"http:\/\/www.parsonsmatt.org\/2017\/11\/21\/monadbasecontrol_in_five_minutes.html\">MonadBaseControl in five minutes<\/a>. ~ Matt Parsons (@mattoflambda) #Haskell<\/li>\n<li><a href=\"https:\/\/haskell-serbia.com\/tutorial\/4\">Dependent types in Haskell<\/a>. ~ Sasa Bogicevic #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/ra2017-razonamiento-estructurado-sobre-programas-con-isabellehol\/\">RA2017: Razonamiento estructurado sobre programas con Isabelle\/HOL<\/a>. #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/jfr.unibo.it\/article\/download\/6767\/7213\">A formally proved, complete algorithm for path resolution with symbolic links<\/a>. ~ R. Chen, M. Clochard, C. March\u00e9 #ITP #Coq<\/li>\n<li><a href=\"http:\/\/www.timphilipwilliams.com\/posts\/2017-04-12-nested-datacubes.html\">Functional pearl: Nested Datacubes<\/a>. ~ Tim Philip Williams (@_willtim_) #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/cadenas-de-sumas-de-factoriales-de-los-digitos\">Exercitium: &#8220;Cadenas de sumas de factoriales de los d\u00edgitos&#8221;<\/a>. #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/ipfs.io\/ipfs\/QmfN5DojVnEsf1Une3DFwfUiFpfWnQf31f61qgybiXVeQE\/blog\/spheres-and-points\/\">Spheres and points<\/a>. ~ Bassel Mabsout #Haskell<\/li>\n<li><a href=\"https:\/\/modalduality.org\/tzimtsum\">tzimtsum: A Presburger arithmetic proposition decider Haskell library<\/a>. #Haskell #Logic #Math<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/browser_info\/current\/AFP\/Stochastic_Matrices\/document.pdf\">Stochastic matrices and the Perron-Frobenius theorem in Isabelle\/HOL<\/a>. ~ R. Thiemann #IsabelleHOL #Math<\/li>\n<li><a href=\"http:\/\/www.timphilipwilliams.com\/slides\/AnEDSLForKDBQ.pdf\">An EDSL for KDB\/Q (rationale, techniques and lessons learned)<\/a>. ~ Tim Williams (@_willtim_) #Haskell<\/li>\n<li><a href=\"https:\/\/github.com\/k-bx\/fcafe-lazy-evaluation\/blob\/master\/Talk%20Notes%20-%20Lazy%20Evaluation%20in%20Haskell.md\">Talk notes: Lazy evaluation in Haskell<\/a>. ~ Kostiantyn Rybnikov (@ko_bx) #Haskell<\/li>\n<li><a href=\"https:\/\/github.com\/HeinrichApfelmus\/hyper-haskell\">HyperHaskell: a graphical interpreter for the programming language Haskell<\/a>. ~ Heinrich Apfelmus #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-ejercicios-sobre-arboles-binarios-en-haskell-2\/\">Ejercicios sobre \u00e1rboles binarios en Haskell (2)<\/a>. #I1M2017 #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-ejercicios-de-tipos-de-datos-algebraicos-en-haskell-1\/\">Ejercicios de tipos de datos algebraicos en Haskell (1)<\/a>. #I1M2017 #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/i1m2017-programa-en-haskell-para-reconocer-tautologias\/\">Programa en Haskell para reconocer tautolog\u00edas<\/a>. #I1M2017 #Haskell #Matem\u00e1ticas #L\u00f3gica<\/li>\n<li><a href=\"https:\/\/eccc.weizmann.ac.il\/report\/2017\/179\/download\">IPS-like proof systems based on binary decision diagrams<\/a>. ~ A. Knop #Logic #AR #IPS<\/li>\n<li><a href=\"http:\/\/www.cs.toronto.edu\/~jgrochow\/grochow,pitassi-circuitsProofsPIT.pdf\">Circuit complexity, proof complexity, and polynomial identity testing<\/a>. ~ J.A. Grochow, T. Pitassi #AR #Gr\u00f6bnerBases<\/li>\n<li><a href=\"https:\/\/github.com\/nikivazou\/presentations\/raw\/master\/type-theory-in-15-min\/type-theory-in-15min.pdf\">Type theory in 15min<\/a>. ~ Niki Vazou (@nikivazou) #Programming<\/li>\n<li><a href=\"http:\/\/www1.eafit.edu.co\/asr\/pubs\/others\/AcevedoAcosta-EcheverriJurado-2017.Una-formalisacion-del-sistema-de-los-numeros-reales-impresora.pdf\">Una formalizaci\u00f3n del sistema de los n\u00fameros reales<\/a>. ~ J.O. Acevedo y J.L. Echeverri #ITP #Agda<\/li>\n<li><a href=\"https:\/\/github.com\/lspitzner\/exference\">Exference: Haskell tool to generate expressions from types<\/a>. ~ Lennart Spitzner #Haskell<\/li>\n<li><a href=\"https:\/\/github.com\/lspitzner\/exference-paper\/raw\/master\/exference.pdf\">Exference: Rubbing the Lamp once more<\/a>. ~ Lennart Spitzner #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/numero-de-divisores\">Exercitium: &#8220;N\u00famero de divisores&#8221;<\/a>. #Haskell #I1M2017 #Haskell #I1M2017<\/li>\n<li><a href=\"http:\/\/ldc.usb.ve\/~emhn\/cursos\/ci4251\/\">Programaci\u00f3n funcional avanzada (2017)<\/a>. ~ Ernesto Hern\u00e1ndez-Novich (@iamemhn) #Curso #Haskell<\/li>\n<li><a href=\"https:\/\/www.nytimes.com\/2017\/11\/21\/magazine\/can-ai-be-taught-to-explain-itself.html\">Can A.I. be taught to explain itself?<\/a> ~ C. Kuang #XAI<\/li>\n<li><a href=\"https:\/\/elbauldelprogramador.com\/teoria-categorias-scala-tipos-funciones\">Teor\u00eda de categor\u00edas en Scala: Tipos y funciones<\/a>. ~ A. Alcalde #Teor\u00edaCategor\u00edas #Scala<\/li>\n<li><a href=\"https:\/\/github.com\/carp-lang\/carp\">Carp: A statically typed Lisp, without a GC, for high performance applications<\/a>. #Haskell #Lisp<\/li>\n<li><a href=\"http:\/\/www.mordonez.me\/porque-usar-programacion-funcional\">\u00bfPorqu\u00e9 usar programaci\u00f3n funcional?<\/a> ~ Marco Ordo\u00f1ez #ProgramacionFuncional v\u00eda @nihilipster<\/li>\n<li><a href=\"https:\/\/rjlipton.wordpress.com\/2017\/11\/27\/proving-peano-arithmetic-partially-consistent\">Proving Peano arithmetic partially consistent?<\/a> ~ R.J. Lipton &amp; K.W. Regan #Logic<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/browser_info\/current\/AFP\/Stochastic_Matrices\/document.pdf\">Stochastic matrices and the Perron\u2013Frobenius theorem in Isabelle\/HOL<\/a>. ~ Ren\u00e9 Thiemann #ITP #IsabelleHOL #Math<\/li>\n<li><a href=\"https:\/\/dspace.library.uu.nl\/bitstream\/handle\/1874\/355676\/sessiontypes-thesis.pdf\">Session types in Cloud Haskell<\/a>. ~ Ferdinand van Walree #PhD_Thesis #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/punto-de-inflexion\">Exercitium: &#8220;Punto de inflexi\u00f3n&#8221;<\/a>. #Haskell #I1M2017 todos los d\u00edgitos&#8221;]]. #Haskell #I1M2017<\/li>\n<li><a href=\"https:\/\/blog.jle.im\/entry\/hamiltonian-dynamics-in-haskell.html\">Hamiltonian dynamics in Haskell<\/a>. ~ Justin Le (@mstk) #Haskell #Math #Physic<\/li>\n<li><a href=\"https:\/\/www.stephanboyer.com\/post\/134\/my-unusual-hobby\">My unusual hobby<\/a>. ~ Stephan Boyer (@stepchowfun) #ITP #Coq<\/li>\n<li><a href=\"https:\/\/github.com\/ocramz\/sparse-linear-algebra\">sparse-linear-algebra: Numerical computation in native Haskell<\/a>. ~ Marco Zocca #Haskell #Math<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1711.09286\">Total Haskell is reasonable Coq<\/a>. ~ A. Spector-Zabusky, J. Breitner, C. Rizkallah, S. Weirich #Haskell #Coq<\/li>\n<li><a href=\"https:\/\/eli.thegreenplace.net\/2017\/deciphering-haskells-applicative-and-monadic-parsers\">Deciphering Haskell&#8217;s applicative and monadic parsers<\/a>. ~ Eli Bendersky (@elibendersky) #Haskell<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/sucesion-contadora\">Exercitium: &#8220;Sucesi\u00f3n contadora&#8221;<\/a>. #Haskell #I1M2017 #Haskell #I1M2017<\/li>\n<li><a href=\"http:\/\/francis.naukas.com\/2017\/11\/25\/resena-apologia-de-un-matematico-de-g-h-hardy\/\">Rese\u00f1a: &#8220;Apolog\u00eda de un matem\u00e1tico&#8221; de G. H. Hardy<\/a>. ~ F.R. Villatoro (@emulenews) #Matem\u00e1ticas<\/li>\n<li><a href=\"https:\/\/github.com\/jaalonso\/Categorias_y_programacion\">Lecturas sobre teor\u00eda de categor\u00edas y programaci\u00f3n funcional<\/a>. #TeoriaDeCategorias #ProgramacionFuncional #Haskell<\/li>\n<li><a href=\"https:\/\/arxiv.org\/pdf\/1606.08813\">European Union regulations on algorithmic decision-making and a &#8220;right to explanation&#8221;<\/a>. ~ B. Goodman, S. Flaxman #MachineLearning<\/li>\n<li><a href=\"https:\/\/github.com\/HaskellChamber\/Haskell-University\">Haskell-University: Portfolio-based approach to learning Haskell<\/a>. #Haskell<\/li>\n<li><a href=\"https:\/\/pursuit.purescript.org\/packages\/purescript-symmetric-groups\/0.1.0\/docs\/Data.SymmetricGroup\">Symmetric groups on finite sets in PureScript<\/a>. #PureScript #Math<\/li>\n<li><a href=\"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/mayor-producto-de-las-ramas-de-un-arbol\">Exercitium: &#8220;Mayor producto de las ramas de un \u00e1rbol&#8221;<\/a>. #Haskell #I1M2017<\/li>\n<\/ul>\n<\/div>\n<div id=\"postamble\"><\/div>\n","protected":false},"excerpt":{"rendered":"<p>Esta entrada es una recopilaci\u00f3n de lecturas compartidas, durante noviembre de 2017, en Twitter sobre programaci\u00f3n funcional y demostraci\u00f3n asistida por ordenador. Las lecturas est\u00e1n ordenadas seg\u00fan su fecha de publicaci\u00f3n en Twitter. Al final de cada art\u00edculo se encuentran etiquetas relativas a los sistemas que usa o a su contenido.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","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":[6],"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\/6065"}],"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=6065"}],"version-history":[{"count":6,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/6065\/revisions"}],"predecessor-version":[{"id":6158,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/6065\/revisions\/6158"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=6065"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=6065"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=6065"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}