{"id":6727,"date":"2019-04-01T11:22:14","date_gmt":"2019-04-01T09:22:14","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=6727"},"modified":"2019-09-01T11:23:35","modified_gmt":"2019-09-01T09:23:35","slug":"resumen-de-lecturas-compartidas-durante-marzo-de-2019","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/resumen-de-lecturas-compartidas-durante-marzo-de-2019\/","title":{"rendered":"Resumen de lecturas compartidas durante marzo de 2019"},"content":{"rendered":"<div id=\"content\">\n<p>Esta entrada es una recopilaci\u00f3n de lecturas compartidas, durante marzo de 2019, en <a href=\"https:\/\/twitter.com\/Jose_A_Alonso\">Twitter<\/a> fundamentalmente sobre programaci\u00f3n funcional y demostraci\u00f3n asistida por ordenador.<\/p>\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.<\/p>\n<p>Una recopilaci\u00f3n de todas las lecturas compartidas se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Lecturas_GLC\">GitHub<\/a>.<\/p>\n<p><!--more--><\/p>\n<ul class=\"org-ul\">\n<li><a href=\"https:\/\/coot.me\/posts\/monoidal-functors.html\">Monoidal and applicative functors<\/a>. ~ Marcin Szamotulski. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/wickstrom.tech\/programming\/2019\/03\/02\/property-based-testing-in-a-screencast-editor-introduction.html\">Property-based testing in a screencast editor: Introduction<\/a>. ~ Oskar Wickstr\u00f6m. #Haskell<\/li>\n<li><a href=\"https:\/\/jaspervdj.be\/posts\/2019-02-27-beeraffe.html\">Beeraffe: A silly game in PureScript<\/a>. ~ Jasper Van der Jeugt. #PureScript<\/li>\n<li><a href=\"https:\/\/blog.sumtypeofway.com\/recursion-schemes-part-6-comonads-composition-and-generality\/\">Recursion schemes, part VI: Comonads, composition, and generality<\/a>. ~ Patrick Thomson. #Haskell<\/li>\n<li><a href=\"https:\/\/beautifulracket.com\">Beautiful Racket (an introduction to language oriented programming using Racket)<\/a>. ~ Matthew Butterick. #Racket #Programming<\/li>\n<li><a href=\"http:\/\/www.cs.cornell.edu\/courses\/cs3110\/2019sp\/textbook\/\">Functional programming in OCaml<\/a>. ~ Michael R. Clarkson. #eBook #OCaml #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/ro-che.info\/articles\/2019-03-02-lazy-validation-applicative\">Lazy validation<\/a>. ~ Roman Cheplyaka. #Haskell<\/li>\n<li><a href=\"https:\/\/defungames.com\/2019\/02\/the-basics-of-game-programming-in-common-lisp\/\">The basics of game programming in Common Lisp<\/a>. ~ Mauricio Fernandez. #CommonLisp<\/li>\n<li><a href=\"https:\/\/cleytonfar.github.io\/posts\/using-julia-for-data-science-part-02\/\">Using Julia for Data Science (Part 02)<\/a>. ~ Cleyton Farias. #JuliaLang #DataScience<\/li>\n<li><a href=\"https:\/\/interstices.info\/pourquoi-creer-des-nouveaux-langages-de-programmation\/%20\">Pourquoi cr\u00e9er des nouveaux langages de programmation?<\/a> ~ Ludovic Henrio. #Programmation<\/li>\n<li><a href=\"https:\/\/towardsdatascience.com\/all-your-matplotlib-questions-answered-420dd95cb4ff\">Matplotlib guide for people in a hurry<\/a>. ~ Julia Kho. #Python #Matplotlib<\/li>\n<li><a href=\"https:\/\/github.com\/snowleopard\/selective\">Selective applicative functors: declare your effects statically, select which to execute dynamically<\/a>. ~ A. Mokhov. #Haskell<\/li>\n<li><a href=\"https:\/\/juliendehos.gitlab.io\/lillefp-2019-isomorphic\">Isomorphic web apps in Haskell<\/a>. ~ Julien Dehos. #Haskell<\/li>\n<li><a href=\"http:\/\/julien.dehos.free.fr\/build\/html\/PFW\/index.html\">Programmation fonctionnelle pour le web<\/a>. ~ Julien Dehos. #Haskell<\/li>\n<li><a href=\"http:\/\/julien.dehos.free.fr\/build\/html\/PF\/nn42h.html\">Neural network in 42 lines of Haskell<\/a>. ~ Julien Dehos. #Haskell<\/li>\n<li><a href=\"https:\/\/mmhaskell.com\/blog\/2019\/3\/4\/shareable-haskell-with-jupyter\">Shareable Haskell with Jupyter!<\/a> ~ James Bowen. #Haskell #Jupyter<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1902.10971\">Infinite types, infinite data, infinite interaction<\/a>. ~ P. Hyvernat. #ITP #Agda<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1902.10809\">Means compatible with semigroup laws<\/a>. ~ R. Padmanabhan, A. Shukla. #ATP #Prover9 #Math<\/li>\n<li><a href=\"https:\/\/introtcs.org\/public\/index.html\">Introduction to theoretical computer science<\/a>. ~ Boaz Barak. #eBook #CompSci<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1903.00686\">DimDraw: A novel tool for drawing concept lattices<\/a>. ~ D. D\u00fcrrschnabel, T. Hanika, G. Stumme. #AFC<\/li>\n<li><a href=\"http:\/\/www.eelis.net\/research\/math-classes\/mscs.pdf\">Type classes for mathematics in type theory<\/a>. ~ B. Spitters, E. van der Weegen. #ITP #Coq #Math<\/li>\n<li><a href=\"https:\/\/github.com\/uds-psl\/coq-library-undecidability\">A library of formalised undecidable problems in Coq<\/a>. ~ Dominique Larchey-Wendling et als. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1903.02539\">GRUNGE: A grand unified ATP challenge<\/a>. ~ C.E. Brown, T. Gauthier, C. Kaliszyk, G. Sutcliffe, J. Urban. #ATP<\/li>\n<li><a href=\"https:\/\/youtu.be\/p-t73EGlCMs\">The state of Haskell in Ethereum<\/a>. ~ Martin Allen. #Haskell<\/li>\n<li><a href=\"https:\/\/medium.com\/@josh_40272\/why-i-use-julia-8eb47216880e\">Why I use Julia. (Come for the speed. Stay for the productivity)<\/a>. ~ Josh Day #LuliaLang<\/li>\n<li><a href=\"https:\/\/softwareengineering.stackexchange.com\/questions\/279316\/what-exactly-makes-the-haskell-type-system-so-revered-vs-say-java\/279362#279362?newreg=cc0182f2943f417aa828e40270d43fe7\">What exactly makes the Haskell type system so revered (vs say, Java)?<\/a> #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1801.07528\">Computer-assisted proving of combinatorial conjectures over finite domains: A case study of a chess conjecture<\/a>. ~ P. Jani\u010di\u0107, F. Mari\u0107, M. Malikovi\u0107. #ITP #IsabelleHOL #ATP #SAT #SMT<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1903.01237\">Dijkstra monads for all<\/a>. ~ K. Maillard et als. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/guide.aelve.com\/haskell\/stack-cookbook-ai0adh03\">Stack cookbook<\/a>. #Haskell #Stack<\/li>\n<li><a href=\"http:\/\/jpmoresmau.blogspot.com\/2019\/03\/rust-for-linear-algebra-and-neural.html\">Rust for linear algebra and neural networks<\/a>. ~ J.P. Moresmau. #RustLang #AI #MachineLearnig #Math<\/li>\n<li><a href=\"https:\/\/ilyasergey.wordpress.com\/2015\/12\/27\/on-lamports-critique-of-compositional-reasoning\/\">On Lamport\u2019s critique of compositional reasoning<\/a>. ~ Ilya Sergey. #Programming<\/li>\n<li><a href=\"https:\/\/blog.sicara.com\/jupyter-notebook-analysis-production-b2d585204520\">Why Jupyter is not my ideal notebook<\/a>. ~ Cl\u00e9ment Walter. #Jupyter<\/li>\n<li><a href=\"https:\/\/coot.me\/posts\/free-monads.html\">From free algebras to free monads<\/a>. ~ Marcin Szamotulski. #Haskell #CategoryTheory<\/li>\n<li><a href=\"http:\/\/www.tac.mta.ca\/tac\/reprints\/articles\/22\/tr22.pdf\">Category theory for computing science<\/a>. ~ M. Barr, C. Wells. #eBook #CategoryTheory<\/li>\n<li><a href=\"http:\/\/forum.ulisp.com\/t\/what-are-the-advantages-disadvantages-of-ulisp-vs-c-c\/313\">What are the advantages\/disadvantages of uLisp vs C\/C++?<\/a> #Programming #Lisp #Cpp<\/li>\n<li><a href=\"https:\/\/blog.ploeh.dk\/2019\/03\/11\/an-example-of-state-based-testing-in-haskell\">An example of state-based testing in Haskell<\/a>. ~ Mark Seemann. #Haskell<\/li>\n<li><a href=\"https:\/\/aperiodical.com\/2019\/03\/33-can-be-written-as-the-sum-of-three-cubes\">33 can be written as the sum of three cubes<\/a>. ~ Peter Rowlett. #Math #CompSci<\/li>\n<li><a href=\"http:\/\/www.logicmatters.net\/igt\/godel-without-tears\/\">G\u00f6del without (too many) tears<\/a>. ~ Peter Smith. #Logic<\/li>\n<li><a href=\"https:\/\/cacm.acm.org\/news\/235358-ai-efforts-at-large-companies-may-be-hindered-by-poor-quality-data\/fulltext\">AI efforts at large companies may be hindered by poor quality data<\/a>. #AI<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1802.03685\">Learning a SAT solver from single-bit supervision<\/a>. ~ D. Selsam et als. #SAT #Logic #MachineLearnig<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1903.05175\">On constructive-deductive method for plane euclidean geometry<\/a>. ~ E.V. Ivashkevich. #ITP #Coq #Math<\/li>\n<li><a href=\"https:\/\/chrisdone.com\/posts\/data-typeable\">Typeable and Data in Haskell<\/a>. ~ Chris Done. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/briansteffens.github.io\/2017\/02\/20\/from-math-to-machine.html\">From math to machine: translating a function to machine code<\/a>. ~ Brian Steffens #Haskell #Math<\/li>\n<li><a href=\"https:\/\/bor0.wordpress.com\/2019\/03\/15\/writing-a-simple-evaluator-and-type-checker-in-haskell\">Writing a simple evaluator and type-checker in Haskell<\/a>. ~ Boro Sitnikovski. #Haskell<\/li>\n<li><a href=\"https:\/\/medium.com\/@vindarel\/these-years-in-common-lisp-2018-1d6b9084920d\">These years in Common Lisp: 2018<\/a>. ~ Vince Zd #CommonLisp<\/li>\n<li><a href=\"https:\/\/ryanglscott.github.io\/2019\/03\/15\/visible-dependent-quantification-in-haskell\/\">Visible dependent quantification in Haskell<\/a>. ~ Ryan Scott. #Haskell<\/li>\n<li><a href=\"https:\/\/unsafeperform.io\/talks\/2019-03-sit-applicative-cooking\/Applicative_Cooking.pdf\">Cooking a Haskell curry with applicative functors<\/a>. ~ G. \u00c9rdi. #Haskell<\/li>\n<li><a href=\"http:\/\/www.lsv.fr\/~dowek\/Publi\/logipedia.pdf\">Logipedia: a multi-system encyclopedia of formal proofs<\/a>. ~ G. Dowek, F. Thir\u00e9. #ITP #Logic #Math #Dedukti #Coq #Matita #HOL_Light #PVS #LeanProver<\/li>\n<li><a href=\"https:\/\/pastel.archives-ouvertes.fr\/tel-01235303v4\/document\">A framework for defining computational higher-order logics<\/a>. ~ A. Assaf. #PhD_Thesis #ITP #Logic #Math #Dedukti<\/li>\n<li><a href=\"https:\/\/www21.in.tum.de\/~eberlm\/ant.pdf\">Nine chapters of analytic number theory in Isabelle\/HOL<\/a>. ~ M. Eberl. #ITP #IsabelleHOL #Math<\/li>\n<li><a href=\"http:\/\/www.cs.nott.ac.uk\/~psxmah\/liquidate.pdf\">Liquidate your assets (Reasoning about resource usage in Liquid Haskell)<\/a>. ~ M. Handley, N. Vazou, G. Hutton. #Haskell<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1901.04773\">Machine learning and the Continuum Hypothesis<\/a>. ~ K.P. Hart. #MachineLearnig #SetTheory<\/li>\n<li><a href=\"https:\/\/mmhaskell.com\/blog\/2019\/3\/4\/extending-haskells-syntax\">Extending Haskell&#8217;s syntax!<\/a> ~ James Bowen. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/blaxill.org\/posts\/compdata-trees-and-catamorphisms\">Compdata trees and catamorphisms<\/a>. ~ Ben Blaxill. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/plus.maths.org\/content\/pure-maths-crisis\">Pure maths in crisis?<\/a> ~ M. Freiberger. #Math #ITP #IsabelleHOL #LeanProver<\/li>\n<li><a href=\"https:\/\/bor0.wordpress.com\/2019\/03\/19\/writing-a-lambda-calculus-evaluator-in-haskell\">Writing a lambda calculus evaluator in Haskell<\/a>. ~ B. Sitnikovski. #Haskell #FunctionalProgramming #LambdaCalculus<\/li>\n<li><a href=\"http:\/\/oatao.univ-toulouse.fr\/22971\/1\/Vasseur_22971.pdf\">Map\/Reduce operations for scientific computing in Julia<\/a>. ~ X. Vasseur. #JuliaLang<\/li>\n<li><a href=\"https:\/\/www.cs.bham.ac.uk\/~mhe\/HoTT-UF-in-Agda-Lecture-Notes\/index.html\">Introduction to Univalent Foundations of Mathematics with Agda<\/a>. ~ Mart\u00edn H\u00f6tzel Escard\u00f3. #ITP #Agda #math #HoTT<\/li>\n<li><a href=\"http:\/\/www.mi.fu-berlin.de\/inf\/groups\/ag-ki\/publications\/proof\/what-is-a-proof.pdf\">What is a proof? What should it be?<\/a> ~ C. Benzm\u00fcller. #Logic #Math #ITP #ATP<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1808.07771\">FMS: Functional programming as a modelling language<\/a>. ~ I. Dasseville, G. Janssens. #FunctionalProgramming #ASP<\/li>\n<li><a href=\"https:\/\/tech.io\/playgrounds\/12240\/functional-modelling-system\">FMS (Functional Modelling System) tutorial<\/a>. ~ I. Dasseville. #FunctionalProgramming #ASP<\/li>\n<li><a href=\"https:\/\/doisinkidney.com\/posts\/2019-03-21-binary-logic-search.html\">Lazy binary numbers<\/a>. ~ Donnacha Ois\u00edn Kidney. #Haskell #Agda<\/li>\n<li><a href=\"https:\/\/dkwise.wordpress.com\/2019\/02\/19\/fractals-and-monads-part-3\/\">Fractals and monads (Part 3)<\/a>. ~ Derek Wise. #Haskell #Math<\/li>\n<li><a href=\"https:\/\/samtay.github.io\/articles\/deriving-via.html\">A small use case for Deriving Via<\/a>. ~ Sam Tay. #Haskell<\/li>\n<li><a href=\"https:\/\/blogs.scientificamerican.com\/cross-check\/okay-maybe-proofs-arent-dying-after-all\/\">Okay, maybe proofs aren&#8217;t dying after all<\/a>. ~ J. Horgan. #Math<\/li>\n<li><a href=\"https:\/\/medium.com\/@stephenebly\/an-introduction-to-existential-types-25c130ba61a4\">An introduction to existential types<\/a>. ~ S. Bly. #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1903.07616\">A constructive proof of dependent choice in classical arithmetic via memoization<\/a>. ~ \u00c9. Miquey. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1903.06758\">Algorithms for verifying deep neural networks<\/a>. ~ C. Liu, T. Arnon, C. Lazarus, C. Barrett, M.J. Kochenderfer. #JuliaLang #NeuralNetworks<\/li>\n<li><a href=\"https:\/\/books.google.es\/books?id=d6t-DwAAQBAJ&amp;printsec=frontcover#v=onepage&amp;q&amp;f=false\">Introduction to Python for science and engineering<\/a>. ~ D.J. Pine. #eBook #Programming #Python<\/li>\n<li><a href=\"https:\/\/mally.stanford.edu\/Papers\/cs-metaphysics.pdf\">Computer science and metaphysics: a cross-fertilization<\/a>. ~ D. Kirchner, C. Benzm\u00fcller, E.N. Zalta. #ITP #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/doisinkidney.com\/posts\/2019-03-24-permutations-by-sorting.html\">Permutations by sorting<\/a>. ~ Donnacha Ois\u00edn Kidney. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/jproyo.github.io\/posts\/2019-03-17-tagless-final-haskell.html\">Tagless final encoding in Haskell<\/a>. ~ J.P. Royo. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/entries\/QHLProver.html\">Quantum Hoare logic in Isabelle\/HOL<\/a>. ~ J. Liu et als. #ITP #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1903.09475\">Using SMT solvers to validate models for AI problems<\/a>. ~ A. Arusoaie, I. Pistol. #ATP #SMT #AI<\/li>\n<li><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S235234091930174X\">Universal (meta-) logical reasoning: The wise men puzzle (Isabelle\/HOL dataset)<\/a>. ~ C. Benzm\u00fcller. #ITP #IsabelleHOL #Logic<\/li>\n<li><a href=\"https:\/\/cs.uwaterloo.ca\/~cbright\/reports\/projplane.pdf\">A verifiable search for projective planes of order ten<\/a>. ~ C. Bright. #ATP #SAT #Math<\/li>\n<li><a href=\"https:\/\/cs.uwaterloo.ca\/~cbright\/reports\/sat.pdf\">The SAT+CAS method for combinatorial search with applications to best matrices<\/a>. ~ C. Bright et als. #ATP #SAT #CAS #Math<\/li>\n<li><a href=\"https:\/\/chshersh.github.io\/posts\/2019-03-25-comonadic-builders\">Comonadic builders<\/a>. ~ Dmitrii Kovanikov. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/medium.com\/@stackdoesnotwork\/the-minimalist-prelude-3e187bc834fc\">The minimalist Prelude \u2026 or why can\u2019t Haskell be more like Purescript?<\/a> #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/doisinkidney.com\/posts\/2019-02-25-agda-fingertrees.html\">Finger trees in Agda<\/a>. ~ Donnacha Ois\u00edn Kidney. #Agda<\/li>\n<li><a href=\"https:\/\/bartoszmilewski.com\/2019\/03\/27\/promonads-arrows-and-einstein-notation-for-profunctors\/\">Promonads, arrows, and Einstein notation for profunctors<\/a>. ~ Bartosz Milewski. #Haskel #CategoryTheory<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/entries\/Transcendence_Series_Hancl_Rucki.html\">The transcendence of certain infinite series in Isabelle\/HOL<\/a>. ~ A, Koutsoukou-Argyraki, W. Li. #ITP #IsabelleHOL #Math<\/li>\n<li><a href=\"https:\/\/www.irif.fr\/~kerjean\/TYPES19.pdf\">A formal, classical proof of the Hahn-Banach theorem<\/a>. ~ M. Kerjean, A. Mahboubi. #ITP #Coq #Math<\/li>\n<li><a href=\"https:\/\/cs.brynmawr.edu\/~rae\/papers\/2019\/partialdata\/partialdata.pdf\">Partial type constructors (extended version)<\/a>. ~ M.P. Jones et als. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"http:\/\/icla2019.cse.iitd.ac.in\/slides\/5th%20March-19\/4-Abhishek_Kr_Singh.pdf\">Towards a constructive formalization of Perfect Graph Theorems (Slides)<\/a>]. ~ A.K. Singh. R. Natarajan. #ITP #Coq #Math<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1812.11108\">Towards a constructive formalization of Perfect Graph Theorems<\/a>. ~ A.K. Singh. R. Natarajan. #ITP #Coq #Math<\/li>\n<\/ul>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Esta entrada es una recopilaci\u00f3n de lecturas compartidas, durante marzo de 2019, en Twitter fundamentalmente 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. Una recopilaci\u00f3n de&#8230;<\/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\/6727"}],"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=6727"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/6727\/revisions"}],"predecessor-version":[{"id":6728,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/6727\/revisions\/6728"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=6727"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=6727"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=6727"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}