Fri Feb 2 15:00:04 UTC 2018

Author: libreimbot

blog/2014/04/12/desigualdad-medias/index.html

@@ -345,13 +345,13 @@ <h3 id="minimizando-el-volumen">Minimizando el volumen</h3>
 <div class="footnotes">
   <ol>
     <li id="fn:holdermean">
-      <p><a href="http://en.wikipedia.org/wiki/Generalized_mean">Medias de Hölder</a>&nbsp;<a href="#fnref:holdermean" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://en.wikipedia.org/wiki/Generalized_mean">Medias de Hölder</a> <a href="#fnref:holdermean" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:gmeanproof">
-      <p><a href="http://planetmath.org/sites/default/files/texpdf/35741.pdf">Derivación de la media geométrica como media de Hölder</a>&nbsp;<a href="#fnref:gmeanproof" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://planetmath.org/sites/default/files/texpdf/35741.pdf">Derivación de la media geométrica como media de Hölder</a> <a href="#fnref:gmeanproof" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:generalproof">
-      <p><a href="http://planetmath.org/sites/default/files/texpdf/33619.pdf">Demostración de la desigualdad de las medias generalizada</a>&nbsp;<a href="#fnref:generalproof" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://planetmath.org/sites/default/files/texpdf/33619.pdf">Demostración de la desigualdad de las medias generalizada</a> <a href="#fnref:generalproof" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2014/06/24/introduccion-javascript/index.html

@@ -514,25 +514,25 @@ <h2 id="conclusión">Conclusión</h2>
 <div class="footnotes">
   <ol>
     <li id="fn:jsannouncement">
-      <p><a href="https://web.archive.org/web/20070916144913/http://wp.netscape.com/newsref/pr/newsrelease67.html">Netscape and Sun announce JavaScript. Press Release</a>&nbsp;<a href="#fnref:jsannouncement" class="reversefootnote">&#8617;</a></p>
+      <p><a href="https://web.archive.org/web/20070916144913/http://wp.netscape.com/newsref/pr/newsrelease67.html">Netscape and Sun announce JavaScript. Press Release</a> <a href="#fnref:jsannouncement" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:mdnjs">
-      <p><a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/About_JavaScript">About JavaScript - Mozilla Developer Network</a>&nbsp;<a href="#fnref:mdnjs" class="reversefootnote">&#8617;</a></p>
+      <p><a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/About_JavaScript">About JavaScript - Mozilla Developer Network</a> <a href="#fnref:mdnjs" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:jsidentifiers">
-      <p><a href="http://mathiasbynens.be/notes/javascript-identifiers">Valid JavaScript variable names - Mathias Bynens</a>&nbsp;<a href="#fnref:jsidentifiers" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://mathiasbynens.be/notes/javascript-identifiers">Valid JavaScript variable names - Mathias Bynens</a> <a href="#fnref:jsidentifiers" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:quirksevents">
-      <p><a href="http://www.quirksmode.org/js/introevents.html">Introduction to Events - Quirks Mode</a>&nbsp;<a href="#fnref:quirksevents" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://www.quirksmode.org/js/introevents.html">Introduction to Events - Quirks Mode</a> <a href="#fnref:quirksevents" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:jsencapsulation">
-      <p><a href="http://aboutcode.net/2011/10/04/efficient-encapsulation-of-javascript-objects.html">Efficient encapsulation of JavaScript objects</a>&nbsp;<a href="#fnref:jsencapsulation" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://aboutcode.net/2011/10/04/efficient-encapsulation-of-javascript-objects.html">Efficient encapsulation of JavaScript objects</a> <a href="#fnref:jsencapsulation" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:jsinheritance">
-      <p><a href="http://tobyho.com/2010/11/22/javascript-constructors-and/">Javascript Constructors and Prototypes - Toby Ho</a>&nbsp;<a href="#fnref:jsinheritance" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://tobyho.com/2010/11/22/javascript-constructors-and/">Javascript Constructors and Prototypes - Toby Ho</a> <a href="#fnref:jsinheritance" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:jslibroalarcon">
-      <p><a href="http://books.google.es/books?id=IJBXNQAACAAJ">JavaScript - Revisado y actualizado 2004</a>, <a href="https://twitter.com/jm_alarcon">José Manuel Alarcón</a>&nbsp;<a href="#fnref:jslibroalarcon" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://books.google.es/books?id=IJBXNQAACAAJ">JavaScript - Revisado y actualizado 2004</a>, <a href="https://twitter.com/jm_alarcon">José Manuel Alarcón</a> <a href="#fnref:jslibroalarcon" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2014/10/01/intro-haskell/index.html

@@ -128,10 +128,10 @@ <h1>
 <div class="footnotes">
   <ol>
     <li id="fn:rankingtiobe">
-      <p><a href="http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html">TIOBE - Programming Community Index</a>&nbsp;<a href="#fnref:rankingtiobe" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html">TIOBE - Programming Community Index</a> <a href="#fnref:rankingtiobe" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:haskellwikipedia">
-      <p><a href="http://en.wikipedia.org/wiki/Haskell_%28programming_language%29">Haskell - Wikipedia, the free encyclopedia</a>&nbsp;<a href="#fnref:haskellwikipedia" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://en.wikipedia.org/wiki/Haskell_%28programming_language%29">Haskell - Wikipedia, the free encyclopedia</a> <a href="#fnref:haskellwikipedia" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2014/10/04/intro-categorias/index.html

@@ -127,7 +127,7 @@ <h1>
 <div class="footnotes">
   <ol>
     <li id="fn:categoriaswikipedia">
-      <p><a href="http://es.wikipedia.org/wiki/Teor%C3%ADa_de_categor%C3%ADas">Teoría de Categorías - Wikipedia, the free encyclopedia</a>&nbsp;<a href="#fnref:categoriaswikipedia" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://es.wikipedia.org/wiki/Teor%C3%ADa_de_categor%C3%ADas">Teoría de Categorías - Wikipedia, the free encyclopedia</a> <a href="#fnref:categoriaswikipedia" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2014/12/04/curry-howard/index.html

@@ -126,7 +126,7 @@ <h1>
 <div class="footnotes">
   <ol>
     <li id="fn:curryhowardwiki">
-      <p><a href="http://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspondence">Curry-Howard correspondence - Wikipedia, the free encyclopedia</a>&nbsp;<a href="#fnref:curryhowardwiki" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspondence">Curry-Howard correspondence - Wikipedia, the free encyclopedia</a> <a href="#fnref:curryhowardwiki" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2015/03/14/aproximacion-a-pi/index.html

@@ -202,7 +202,7 @@ <h2 id="algoritmo-de-borwein">Algoritmo de Borwein</h2>
 <div class="footnotes">
   <ol>
     <li id="fn:study-in-analytic-number-theory">
-      <p><em>Jonathon M. Borwein, Peter B. Borwein, Pi and the AGM</em> - A Study in Analytic Number Theory and Computational Complexity, <em>Wiley, New York, 1987 Jorg Arndt, Christoph Haenel, Pi Unleashed, Springer, Berlin, 2001, ISBN 3-540-66572-2</em>.&nbsp;<a href="#fnref:study-in-analytic-number-theory" class="reversefootnote">&#8617;</a></p>
+      <p><em>Jonathon M. Borwein, Peter B. Borwein, Pi and the AGM</em> - A Study in Analytic Number Theory and Computational Complexity, <em>Wiley, New York, 1987 Jorg Arndt, Christoph Haenel, Pi Unleashed, Springer, Berlin, 2001, ISBN 3-540-66572-2</em>. <a href="#fnref:study-in-analytic-number-theory" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2015/03/14/induccion-estructural/index.html

@@ -229,7 +229,7 @@ <h2 id="ejemplo-2-árboles-binarios">Ejemplo 2: Árboles binarios</h2>
 <div class="footnotes">
   <ol>
     <li id="fn:stackexchangeblog-induction">
-      <p>Sobre generalizaciones de la inducción <a href="http://math.blogoverflow.com/2015/03/10/when-can-we-do-induction/">http://math.blogoverflow.com/2015/03/10/when-can-we-do-induction/</a>&nbsp;<a href="#fnref:stackexchangeblog-induction" class="reversefootnote">&#8617;</a></p>
+      <p>Sobre generalizaciones de la inducción <a href="http://math.blogoverflow.com/2015/03/10/when-can-we-do-induction/">http://math.blogoverflow.com/2015/03/10/when-can-we-do-induction/</a> <a href="#fnref:stackexchangeblog-induction" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2015/03/24/algebra-tipos/index.html

@@ -419,16 +419,16 @@ <h2 id="más-información">Más información</h2>
 <div class="footnotes">
   <ol>
     <li id="fn:haskell-void-98">
-      <p>Aunque para seguir el estándar <strong>Haskell 98</strong> requeriría de una definición ligeramente diferente. Puede consultarse el <a href="https://hackage.haskell.org/package/void-0.7/docs/src/Data-Void.html#Void">código fuente</a>.&nbsp;<a href="#fnref:haskell-void-98" class="reversefootnote">&#8617;</a></p>
+      <p>Aunque para seguir el estándar <strong>Haskell 98</strong> requeriría de una definición ligeramente diferente. Puede consultarse el <a href="https://hackage.haskell.org/package/void-0.7/docs/src/Data-Void.html#Void">código fuente</a>. <a href="#fnref:haskell-void-98" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:haskell-list-def">
-      <p>Definición de lista en el preludio de Haskell. <a href="https://www.haskell.org/onlinereport/standard-prelude.html">https://www.haskell.org/onlinereport/standard-prelude.html</a>&nbsp;<a href="#fnref:haskell-list-def" class="reversefootnote">&#8617;</a></p>
+      <p>Definición de lista en el preludio de Haskell. <a href="https://www.haskell.org/onlinereport/standard-prelude.html">https://www.haskell.org/onlinereport/standard-prelude.html</a> <a href="#fnref:haskell-list-def" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:taylor-algebratypes">
-      <p>The Algebra of algebraic data types. Chris Taylor. <a href="http://chris-taylor.github.io/blog/2013/02/10/the-algebra-of-algebraic-data-types/">http://chris-taylor.github.io/blog/2013/02/10/the-algebra-of-algebraic-data-types/</a>&nbsp;<a href="#fnref:taylor-algebratypes" class="reversefootnote">&#8617;</a></p>
+      <p>The Algebra of algebraic data types. Chris Taylor. <a href="http://chris-taylor.github.io/blog/2013/02/10/the-algebra-of-algebraic-data-types/">http://chris-taylor.github.io/blog/2013/02/10/the-algebra-of-algebraic-data-types/</a> <a href="#fnref:taylor-algebratypes" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:milewski-functiontypes">
-      <p>Function types. Bartosz Milewski. <a href="http://bartoszmilewski.com/2015/03/13/function-types/">http://bartoszmilewski.com/2015/03/13/function-types/</a>&nbsp;<a href="#fnref:milewski-functiontypes" class="reversefootnote">&#8617;</a></p>
+      <p>Function types. Bartosz Milewski. <a href="http://bartoszmilewski.com/2015/03/13/function-types/">http://bartoszmilewski.com/2015/03/13/function-types/</a> <a href="#fnref:milewski-functiontypes" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2015/04/20/teorema-dini/index.html

@@ -319,10 +319,10 @@ <h2 id="referencias">Referencias</h2>
 <div class="footnotes">
   <ol>
     <li id="fn:ejercicios">
-      <p><a href="http://www.ugr.es/~fjperez/textos/sucesiones_series_funciones.pdf">Ejercicios de sucesiones y series de funciones. Javier Pérez</a>&nbsp;<a href="#fnref:ejercicios" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://www.ugr.es/~fjperez/textos/sucesiones_series_funciones.pdf">Ejercicios de sucesiones y series de funciones. Javier Pérez</a> <a href="#fnref:ejercicios" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:medias">
-      <p><a href="/blog/2014/04/12/desigualdad-medias/">La desigualdad de las medias. Mario Román</a>&nbsp;<a href="#fnref:medias" class="reversefootnote">&#8617;</a></p>
+      <p><a href="/blog/2014/04/12/desigualdad-medias/">La desigualdad de las medias. Mario Román</a> <a href="#fnref:medias" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2015/07/17/segment-tree/index.html

@@ -482,13 +482,13 @@ <h2 id="referencias">Referencias</h2>
 <div class="footnotes">
   <ol>
     <li id="fn:list">
-      <p><a href="https://en.wikipedia.org/wiki/List_of_data_structures">List of Data Structures</a>&nbsp;<a href="#fnref:list" class="reversefootnote">&#8617;</a></p>
+      <p><a href="https://en.wikipedia.org/wiki/List_of_data_structures">List of Data Structures</a> <a href="#fnref:list" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:heap">
-      <p><a href="https://www.youtube.com/watch?v=B7hVxCmfPtM">Heaps and Heapsort, MIT 6.006 Introduction to Algorithms, Fall 2011</a>&nbsp;<a href="#fnref:heap" class="reversefootnote">&#8617;</a></p>
+      <p><a href="https://www.youtube.com/watch?v=B7hVxCmfPtM">Heaps and Heapsort, MIT 6.006 Introduction to Algorithms, Fall 2011</a> <a href="#fnref:heap" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:segment-c">
-      <p><a href="https://kartikkukreja.wordpress.com/2014/11/09/a-simple-approach-to-segment-trees/">A simple approach to segment trees - Kartik Kukreja</a>&nbsp;<a href="#fnref:segment-c" class="reversefootnote">&#8617;</a></p>
+      <p><a href="https://kartikkukreja.wordpress.com/2014/11/09/a-simple-approach-to-segment-trees/">A simple approach to segment trees - Kartik Kukreja</a> <a href="#fnref:segment-c" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2015/08/24/ruby-enumerators/index.html

@@ -689,22 +689,22 @@ <h2 id="references">References</h2>
 <div class="footnotes">
   <ol>
     <li id="fn:ruby-enumerable">
-      <p><a href="http://ruby-doc.org/core-2.2.2/Enumerable.html">Enumerable - Ruby Docs</a>&nbsp;<a href="#fnref:ruby-enumerable" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://ruby-doc.org/core-2.2.2/Enumerable.html">Enumerable - Ruby Docs</a> <a href="#fnref:ruby-enumerable" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:wiki-3comp">
-      <p><a href="https://en.wikipedia.org/wiki/Three-way_comparison">Three-way comparison - Wikipedia</a>&nbsp;<a href="#fnref:wiki-3comp" class="reversefootnote">&#8617;</a></p>
+      <p><a href="https://en.wikipedia.org/wiki/Three-way_comparison">Three-way comparison - Wikipedia</a> <a href="#fnref:wiki-3comp" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:ruby-quicksort">
-      <p><a href="https://www.igvita.com/2009/03/26/ruby-algorithms-sorting-trie-heaps/">Ruby Algorithms: Sorting, Trie and Heaps - Ilya Grigorik</a>&nbsp;<a href="#fnref:ruby-quicksort" class="reversefootnote">&#8617;</a></p>
+      <p><a href="https://www.igvita.com/2009/03/26/ruby-algorithms-sorting-trie-heaps/">Ruby Algorithms: Sorting, Trie and Heaps - Ilya Grigorik</a> <a href="#fnref:ruby-quicksort" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:lazy-ruby">
-      <p><a href="https://sonnym.github.io/2014/04/05/lazy-ruby/">Lazy Ruby - Effluence</a>&nbsp;<a href="#fnref:lazy-ruby" class="reversefootnote">&#8617;</a></p>
+      <p><a href="https://sonnym.github.io/2014/04/05/lazy-ruby/">Lazy Ruby - Effluence</a> <a href="#fnref:lazy-ruby" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:ruby-blocks">
-      <p><a href="http://www.reactive.io/tips/2008/12/21/understanding-ruby-blocks-procs-and-lambdas/">Understanding Ruby Blocks, Procs and Lambdas - Reactive.IO</a>&nbsp;<a href="#fnref:ruby-blocks" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://www.reactive.io/tips/2008/12/21/understanding-ruby-blocks-procs-and-lambdas/">Understanding Ruby Blocks, Procs and Lambdas - Reactive.IO</a> <a href="#fnref:ruby-blocks" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:ruby-enumerator">
-      <p><a href="http://ruby-doc.org/core-2.2.2/Enumerator.html">Enumerator - Ruby Docs</a>&nbsp;<a href="#fnref:ruby-enumerator" class="reversefootnote">&#8617;</a></p>
+      <p><a href="http://ruby-doc.org/core-2.2.2/Enumerator.html">Enumerator - Ruby Docs</a> <a href="#fnref:ruby-enumerator" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>

blog/2016/09/19/aprendiendo-emacs/index.html

@@ -412,13 +412,13 @@ <h2 id="notas">Notas</h2>
 <div class="footnotes">
   <ol>
     <li id="fn:emacs-productivo">
-      <p>Realmente solo puedo decir que a mí me funciona y que en general los atajos de teclado parecen ser <a href="http://ux.stackexchange.com/a/30749">mejores que usar el ratón</a>.&nbsp;<a href="#fnref:emacs-productivo" class="reversefootnote">&#8617;</a></p>
+      <p>Realmente solo puedo decir que a mí me funciona y que en general los atajos de teclado parecen ser <a href="http://ux.stackexchange.com/a/30749">mejores que usar el ratón</a>. <a href="#fnref:emacs-productivo" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:emacs-kill-buffer">
-      <p>El <a href="https://www.gnu.org/software/emacs/manual/html_node/emacs/Killing.html#Killing">sistema</a> que Emacs usa para esto es bastante más sofisticado.&nbsp;<a href="#fnref:emacs-kill-buffer" class="reversefootnote">&#8617;</a></p>
+      <p>El <a href="https://www.gnu.org/software/emacs/manual/html_node/emacs/Killing.html#Killing">sistema</a> que Emacs usa para esto es bastante más sofisticado. <a href="#fnref:emacs-kill-buffer" class="reversefootnote">&#8617;</a></p>
     </li>
     <li id="fn:magit-select">
-      <p>De hecho, podemos seleccionar qué párrafos dentro de un fichero queremos añadir al commit.&nbsp;<a href="#fnref:magit-select" class="reversefootnote">&#8617;</a></p>
+      <p>De hecho, podemos seleccionar qué párrafos dentro de un fichero queremos añadir al commit. <a href="#fnref:magit-select" class="reversefootnote">&#8617;</a></p>
     </li>
   </ol>
 </div>