{"id":7605,"date":"2021-06-01T19:32:15","date_gmt":"2021-06-01T17:32:15","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=7605"},"modified":"2021-08-30T19:33:31","modified_gmt":"2021-08-30T17:33:31","slug":"resumen-de-lecturas-compartidas-durante-mayo-de-2021","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/resumen-de-lecturas-compartidas-durante-mayo-de-2021\/","title":{"rendered":"Resumen de lecturas compartidas durante mayo de 2021"},"content":{"rendered":"<div id=\"content\">\n<p>Esta entrada es una recopilaci\u00f3n de lecturas compartidas, durante mayo de 2021, 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:\/\/www.lavanguardia.com\/ciencia\/20210531\/7484405\/maquinas-creativas.html\">\u00bfPueden las m\u00e1quinas ser creativas?<\/a> ~ Ram\u00f3n L\u00f3pez de M\u00e1ntaras. #IA<\/li>\n<li><a href=\"https:\/\/cdsmithus.medium.com\/fun-with-category-theory-and-dynamical-systems-f470ea5e7809\">Fun with category theory and dynamical systems<\/a>. ~ Chris Smith. #CategoryTheory<\/li>\n<li><a href=\"https:\/\/functional.works-hub.com\/learn\/representable-functors-by-example-6c5c0\">Representable functors: Practical examples<\/a>. ~ Siddharth Bhat. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2105.10914v1\">Quantum and classical registers<\/a>. ~ Dominique Unruh. #ITP #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/dependenttyp.es\/pdf\/thesis.pdf\">Proof repair<\/a>. ~ Talia Ringer. #PhD_Thesis #ITP #Coq<\/li>\n<li><a href=\"https:\/\/www.hindawi.com\/journals\/complexity\/2021\/5525539\/\">CoCEC: An automatic combinational circuit equivalence checker based on the interactive theorem prover<\/a>. ~ Wilayat Khan, Farrukh Aslam Khan, Abdelouahid Derhab, Adi Alhudhaif. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/hal.inria.fr\/hal-03233227\/document\">Some formal tools for computer arithmetic: Flocq and Gappa<\/a>. ~ S. Boldo, G. Melquiond. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2105.12077\">A beginner guide to Iris, Coq and separation logic<\/a>. ~ Elizabeth Dietrich. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/langsec.org\/spw21\/papers\/Chen_LangSec21.pdf\">Mechanized type safety for gradual information flow<\/a>. ~ Tianyu Chen, Jeremy G. Siek. #ITP #Agda<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2105.11267v1\">Actions you can handle: Dependent types for AI plans<\/a>. ~ Alasdair Hill, Ekaterina Komendantskaya, Matthew L. Daggitt, Ronald P. A. Petrick. #ITP #Agda #AI<\/li>\n<li><a href=\"https:\/\/langsec.org\/spw21\/papers\/Hardin_LangSec21.pdf\">Formal synthesis of filter components for use in security-enhancing architectural transformations<\/a>. ~ David S. Hardin, Konrand L. Slind. #ITP #ACL2<\/li>\n<li><a href=\"https:\/\/frasertweedale.github.io\/blog-fp\/posts\/2021-05-23-tax-combinators.html\">A combinator library for taxes<\/a>. ~ Fraser Tweedale. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/cstml.github.io\/2021\/05\/23\/applicative.html\">Haskell: Applicative<\/a>. ~ Vlad P. Luchian. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/youtu.be\/V9_14jjJiuQ\">Testing smart contracts with QuickCheck<\/a>. ~ John Hughes. #Haskell #FunctionalProgramming #QuickCheck<\/li>\n<li><a href=\"http:\/\/www.fstar-lang.org\/tutorial\/\">Proof-oriented programming in F*<\/a>. #ITP #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/softwarefoundations.cis.upenn.edu\/slf-current\">Separation logic foundations (Software Foundations, Volume 6)<\/a>. ~ Arthur Chargu\u00e9raud. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/mathlesstraveled.com\/2021\/05\/25\/the-natural-number-game\/\">The Natural Number Game<\/a>. ~ Brent Yorgey. #ITP #LeanProver #Math<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/entries\/Combinatorics_Words.html\">Combinatorics on words basics<\/a>. ~ \u0160t\u011bp\u00e1n Holub, Martin Ra\u0161ka, \u0160t\u011bp\u00e1n Starosta. #ITP #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/entries\/Combinatorics_Words_Graph_Lemma.html\">Graph lemma<\/a>. ~ \u0160t\u011bp\u00e1n Holub, \u0160t\u011bp\u00e1n Starosta. #ITP #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/entries\/Combinatorics_Words_Lyndon.html\">Lyndon words<\/a>. ~ \u0160t\u011bp\u00e1n Holub, \u0160t\u011bp\u00e1n Starosta. #ITP #IsabelleHOL<\/li>\n<li><a href=\"http:\/\/www.jerf.org\/iri\/post\/2958\">Functors and monads for people who have read too many &#8220;tutorials&#8221;<\/a>. ~ Jeremy Bowers. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/www.fpcomplete.com\/blog\/tying-the-knot-haskell\/\">Tying the Knot in Haskell<\/a>. ~ Michael Snoyman. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/cister-labs.pt\/f-ide2021\/images\/preprints\/F-IDE_2021_paper_10.pdf\">Verifying time complexity of binary search using Dafny<\/a>. ~ Shiri Morshtein et als. #Dafny #Algorithms<\/li>\n<li><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-03225987\/document\">Two new ways to formally prove Dandelin-Gallucci&#8217;s theorem<\/a>. ~ D. Braun, N. Magaud, P. Schreck. #ITP #Coq #Math<\/li>\n<li><a href=\"https:\/\/cister-labs.pt\/f-ide2021\/images\/preprints\/F-IDE_2021_paper_4.pdf\">A logic theory pattern for linearized control systems<\/a>. ~ A. Domenici, C. Bernardeschi. #ITP #PVS<\/li>\n<li><a href=\"https:\/\/kowainik.github.io\/posts\/fixity\">Fix(ity) me<\/a>. ~ Veronika Romashkina, Dmitrii Kovanikov. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/etd.ohiolink.edu\/apexprod\/rws_etd\/send_file\/send?accession=ouhonors161919616626269&amp;disposition=inline\">Translating LaTeX to Coq: A recurrent neural network approach to formalizing natural language proofs<\/a>. ~ Benjamin A. Carman. #PhD_Thesis #ITP #Coq #NeuralNetwork<\/li>\n<li><a href=\"https:\/\/eprint.iacr.org\/2021\/588.pdf\">A novel proof of shuffle: Exponentially secure cut-and-choose<\/a>. ~ Thomas Haines, Johannes M\u00fcller. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/langsec.org\/spw21\/papers\/Egolf_LangSec21.pdf\">Verbatim: A verified lexer generator<\/a>. ~ D. Egolf, S. Lasser, K. Fisher. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/github.com\/openai\/miniF2F\">miniF2F: Formal to Formal Mathematics Benchmark consisting of exercise statements from olympiads (AMC, AIME, IMO)<\/a>. #ITP #LeanProver #Math<\/li>\n<li><a href=\"http:\/\/www.netlib.org\/tex\/bib\/jfunctprogram.pdf\">A complete bibliography of publications in the Journal of Functional Programming<\/a>. ~ Nelson H.F. Beebe. #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/blog.shaynefletcher.org\/2021\/05\/annotations-in-ghc.html\">Annotations in GHC<\/a>. ~ Shayne Fletcher. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/www.quantamagazine.org\/mathematicians-answer-old-question-about-odd-graphs-20210519\/\">Mathematicians answer old question about odd graphs<\/a>. ~ Kevin Hartnett. #Maths<\/li>\n<li><a href=\"https:\/\/github.com\/project-oak\/silveroak\">Silver Oak: Formal specification and verification of hardware, especially for security and privacy<\/a>. #ITP #Coq<\/li>\n<li><a href=\"https:\/\/outline.com\/he3HH7\">An AI has disproved five mathematical conjectures with no human help<\/a>. #AI #Math<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2104.14516\">Constructions in combinatorics via neural networks<\/a>. ~ Adam Zsolt Wagner. #AI #Math #MachineLearning #NeuralNetwork<\/li>\n<li><a href=\"https:\/\/www.haskellforall.com\/2021\/05\/module-organization-guidelines-for.html\">Module organization guidelines for Haskell projects<\/a>. ~ Gabriel Gonzalez. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/github.com\/Debdut\/oeis.haskell\">A collection of OEIS sequences in Haskell<\/a>. ~ Debdut Karmakar. #Haskell #FunctionalProgramming #Math<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2105.05133\">Formally verified simulations of state-rich processes using interaction trees in Isabelle\/HOL<\/a>. ~ Simon Foster, Chung-Kil Hur, Jim Woodcock. #ITP #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/www.mat.unb.br\/~ayala\/Formalization_of_Ring_TheoryR1.pdf\">Formalization of ring theory in PVS (Isomorphism theorems, principal, prime and maximal ideals, chinese remainder theorem)<\/a>. ~ Thaynara Arielly de Lima et als. #ITP #PVS #Math<\/li>\n<li><a href=\"https:\/\/lmcs.episciences.org\/7478\/pdf\">Computable analysis and notions of continuity in Coq<\/a>. ~ H. Thies, L. Thery, F. Steinberg. #ITP #Coq #Math<\/li>\n<li><a href=\"https:\/\/github.com\/leanprover-community\/mathlib\/blob\/9084a3c765f7177d6466c72563998b9f48cf8e81\/src\/order\/fixed_points.lean\">Fixed point construction on complete lattices<\/a>. ~ Johannes H\u00f6lzl et als. #ITP #LeanProver #Math<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2104.14516\">Constructions in combinatorics via neural networks<\/a>. ~ Adam Zsolt Wagner. #MachineLearning #Math<\/li>\n<li><a href=\"https:\/\/www.researchgate.net\/profile\/Angeliki-Koutsoukou-Argyraki\/publication\/351126012_On_Preserving_the_Computational_Content_of_Mathematical_Proofs_Toy_Examples_for_a_Formalising_Strategy\/links\/60895dfe299bf1ad8d632b7b\/On-Preserving-the-Computational-Content-of-Mathematical-Proofs-Toy-Examples-for-a-Formalising-Strategy.pdf\">On preserving the computational content of mathematical proofs: toy examples for a formalising strategy<\/a>. ~ Angeliki Koutsoukou-Argyraki. #ITP #IsabelleHOL #Math<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/entries\/Padic_Ints.html\">Hensel&#8217;s Lemma for the p-adic integers (in Isabelle\/HOL)<\/a>. ~ Aaron Crighton. #ITP #IsabelleHOL #Math<\/li>\n<li><a href=\"https:\/\/typeclasses.com\/phrasebook\">The Haskell Phrasebook<\/a>. ~ Chris Martin, Julie Moronuki. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/haskell.mooc.fi\/part1\">Haskell MOOC University of Helsinki<\/a>. ~ Joel Kaasinen, John L\u00e5ng. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"http:\/\/counterexamples.org\/\">Counterexamples in type systems<\/a>. ~ Stephen Dolan. #TypeTheory<\/li>\n<li><a href=\"https:\/\/youtu.be\/RSJrBEhdZxw\">Qu\u00e9 son los algoritmos y c\u00f3mo aprenden de nosotros<\/a>. | BBC Mundo. #Algoritmos<\/li>\n<li><a href=\"https:\/\/www.microsiervos.com\/archivo\/ia\/enigma-gpt-2-trabajo-falso.html\">Enigma GPT-2: \u00bfPuedes distinguir un art\u00edculo real de otro falso generado mediante inteligencia artificial simplemente leyendo el resumen?<\/a>. ~ @Alvy. #IA<\/li>\n<li><a href=\"https:\/\/theconversation.com\/regreso-al-futuro-de-las-matematicas-si-hipatia-levantara-la-cabeza-158094\">Regreso al futuro de las matem\u00e1ticas: Si Hipatia levantara la cabeza<\/a>. ~ Patricia Contreras Tejada. #Matem\u00e1ticas<\/li>\n<li><a href=\"https:\/\/patternsinfp.wordpress.com\/2021\/05\/10\/the-genuine-sieve-of-eratosthenes\/\">The Genuine Sieve of Eratosthenes<\/a>. ~ Jeremy Gibbons. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/frasertweedale.github.io\/blog-fp\/posts\/2021-05-12-types-garden-path.html\">Type-guided development and garden paths<\/a>. ~ Fraser Tweedale. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/forketyfork.medium.com\/why-you-should-learn-functional-programming-type-classes-vs-interfaces-9d2192d20ac2\">Why you should learn functional programming: Type classes vs. interfaces<\/a>. ~ @forketyfork #Java #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/www.quantamagazine.org\/how-mathematicians-use-homology-to-make-sense-of-topology-20210511\/\">How mathematicians use homology to make sense of topology<\/a>. ~ Kelsey Houston-Edwards. #Math<\/li>\n<li><a href=\"http:\/\/www.cse.chalmers.se\/~jomoa\/papers\/Automated_Conjecturing_in_QuickSpec.pdf\">Automated conjecturing in QuickSpec<\/a>. ~ Moa Johansson, Nicholas Smallbone. #Haskell #FuncionalProgramming<\/li>\n<li><a href=\"http:\/\/functional-algorithms-verified.org\/.\">Functional algorithms, verified! ~ Tobias Nipkow et als<\/a>. #eBook #ITP #IsabelleHOL #Algorithms<\/li>\n<li><a href=\"https:\/\/github.com\/leanprover-community\/mathlib\/blob\/93e9e0d7057889fe4d5ffea7a3f4b45c236a916b\/archive\/100-theorems-list\/16_abel_ruffini.lean\">Construction of an algebraic number that is not solvable by radicals<\/a>. ~ Thomas Browning. #ITP #LeanProver #Math<\/li>\n<li><a href=\"https:\/\/github.com\/IPDSnelting\/tba-2021\">Slides and exercises of the Lean 4 course &#8220;Theorem prover lab: applications in programming languages&#8221;<\/a>. ~ Jakob von Raumer, Sebastian Ullrich. #ITP #Lean4<\/li>\n<li><a href=\"https:\/\/github.com\/digama0\/mm-lean4\">Lean 4 Metamath verifier<\/a>. ~ Mario Carneiro. #ITP #Lean4 #Metamath<\/li>\n<li><a href=\"https:\/\/github.com\/digama0\/lean-type-theory\/releases\/download\/v1.0\/main.pdf\">The type theory of Lean<\/a>. ~ Mario Carneiro. #ITP #LeanProver #TypeTheory<\/li>\n<li><a href=\"https:\/\/www.artofmathematics.org\/books\">Books: Inquiry-Based Learning Guides<\/a>. #eBooks #Math<\/li>\n<li><a href=\"https:\/\/www.welcometothejungle.com\/en\/articles\/btc-deep-learning-clojure-haskell\">The beauty of functional languages in Deep Learning\u200a\u2014\u200aClojure and Haskell<\/a>. ~ Jun Wu. #Clojure #Haskell #FunctionalProgramming #DeepLearning<\/li>\n<li><a href=\"https:\/\/youtu.be\/GtAo8wqWHHg\">The IMO Grand Challenge<\/a>. ~ Daniel Selsam. #ITP #LeanProver<\/li>\n<li><a href=\"https:\/\/www.haskellforall.com\/2021\/05\/the-trick-to-avoid-deeply-nested-error.html\">The trick to avoid deeply-nested error-handling code<\/a>. ~ Gabriel Gonzalez. #Haskell #FunctionalProgramming<\/li>\n<li><a href=\"https:\/\/www.isa-afp.org\/entries\/Regression_Test_Selection.html\">Regression test selection<\/a>. ~ Susannah Mansky. #ITP #IsabelleHOL #Math<\/li>\n<li><a href=\"http:\/\/people.rennes.inria.fr\/Frederic.Besson\/itauto.pdf\">Itauto: an extensible intuitionistic SAT solver<\/a>. ~ Fr\u00e9d\u00e9ric Besson. #ITP #Coq #Logic #SAT_Solver<\/li>\n<li><a href=\"https:\/\/bellmar.medium.com\/programming-in-z3-by-learning-to-think-like-a-compiler-401fd46828d5\">Programming in Z3 by learning to think like a compiler<\/a>. ~ Marianne Bellotti. #SMT #Z3<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2104.15021\">Formalizing the face lattice of polyhedra<\/a>. ~ Xavier Allamigeon, Ricardo D. Katz, Pierre-Yves Strub. #ITP #Coq #Math<\/li>\n<li><a href=\"https:\/\/youtu.be\/mTLuON5eRZI\">Lean Together 2021: Panel on teaching with proof assistants<\/a>. #ITP #LeanProver<\/li>\n<li><a href=\"https:\/\/mazzo.li\/posts\/haskell-backprop-short.html\">Quick and dirty backpropagation in Haskell<\/a>. ~ Francesco Mazzoli. #Haskell #FunctionalProgramming #NeuralNetwork<\/li>\n<li><a href=\"https:\/\/www.logicmatters.net\/2021\/05\/01\/fefermans-logic-mathematics-and-conceptual-structuralism\/\">Feferman\u2019s virtual book: Logic, Mathematics, and Conceptual Structuralism<\/a>. ~ Peter Smith. #Logic #Math<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2104.11613v1\">A formalised theorem in the partition calculus<\/a>. ~ Lawrence C. Paulson. #ITP #IsabelleHOL #Logic #Math<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2104.11622v1\">Producing symmetrical facts for lists induced by the list reversal mapping in Isabelle\/HOL<\/a>. ~ Martin Ra\u0161ka, \u0160t\u011bp\u00e1n Starosta. #ITP #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/schurr.io\/academic\/pubs\/cade2021.pdf\">Reliable reconstruction of fine-grained proofs in a proof assistant<\/a>. ~ HJ Schurr, M Fleury, M Desharnais. #ITP #IsabelleHOL<\/li>\n<li><a href=\"https:\/\/docs.zkproof.org\/pages\/standards\/accepted-workshop4\/proposal-leo.pdf\">LEO: A programming language for formally verified, zero-knowledge applications<\/a>. ~ C. Chin et als. #ITP #ACL2<\/li>\n<li><a href=\"https:\/\/shemesh.larc.nasa.gov\/fm\/papers\/itp2021.pdf\">Formal verification of termination criteria for first-order recursive functions<\/a>. ~ C.A. Mu\u00f1oz et als. #ITP #PVS<\/li>\n<li><a href=\"https:\/\/repository.tudelft.nl\/islandora\/object\/uuid:2d831aa4-df6b-4ab6-983e-9776c710b450\">Verifying the semantics of disambiguation rules (Using parse tree repairing for showing safety and completeness of associativity and priority rules)<\/a>. ~ L. Miljak. #ITP #Coq<\/li>\n<\/ul>\n<\/div>\n<div id=\"postamble\" class=\"status\"><\/div>\n","protected":false},"excerpt":{"rendered":"<p>Esta entrada es una recopilaci\u00f3n de lecturas compartidas, durante mayo de 2021, 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\/7605"}],"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=7605"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/7605\/revisions"}],"predecessor-version":[{"id":7606,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/7605\/revisions\/7606"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=7605"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=7605"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=7605"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}