fix broken links

Author: sarabander

html/References.xhtml

@@ -47,7 +47,7 @@ Systems—Programming Language—Common Lisp</cite>.
 </p>
 <a id="Appel-1987"></a><p>Appel, Andrew W.  1987.  Garbage collection can be faster than stack
 allocation.  <cite>Information Processing Letters</cite> 25(4): 275-279.
-<a href="http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8219">–›</a>
+<a href="https://www.cs.princeton.edu/~appel/papers/45.ps">–›</a>
 </p>
 <a id="Backus-1978"></a><p>Backus, John.  1978.  Can programming be liberated from the von Neumann style?
 <cite>Communications of the <abbr>ACM</abbr></cite> 21(8): 613-641.
@@ -286,7 +286,7 @@ North-Holland.
 </p>
 <a id="Lamport-_00281978_0029"></a><p>Lamport, Leslie. 1978.  Time, clocks, and the ordering of events in a
 distributed system.  <cite>Communications of the <abbr>ACM</abbr></cite> 21(7): 558-565.
-<a href="http://www.stanford.edu/class/cs240/readings/lamport.pdf">–›</a>
+<a href="http://research.microsoft.com/en-us/um/people/lamport/pubs/time-clocks.pdf">–›</a>
 </p>
 <a id="Lampson-et-al_002e-1981"></a><p>Lampson, Butler, J. J. Horning, R.  London, J. G. Mitchell, and G. K.  Popek.
 1981.  Report on the programming language Euclid.  Technical report, Computer
@@ -445,7 +445,7 @@ reference manual.  Memo 203<abbr>A</abbr>, <abbr>MIT</abbr> Artificial Intellige
 </p>
 <a id="Sutherland-_00281963_0029"></a><p>Sutherland, Ivan E.  1963.  <abbr>SKETCHPAD</abbr>: A man-machine graphical
 communication system.  Technical report 296, <abbr>MIT</abbr> Lincoln Laboratory.
-<a href="http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4290">–›</a>
+<a href="https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-574.pdf">–›</a>
 </p>
 <a id="Teitelman-1974"></a><p>Teitelman, Warren.  1974.  Interlisp reference manual.  Technical report, Xerox
 Palo Alto Research Center.
@@ -462,7 +462,7 @@ in Computer Science, volume 123. New York: Springer-Verlag, pp.  334-348.
 </p>
 <a id="Wand-1980"></a><p>Wand, Mitchell.  1980.  Continuation-based program transformation strategies.
 <cite>Journal of the <abbr>ACM</abbr></cite> 27(1): 164-180.
-<a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.8567">–›</a>
+<a href="http://www.diku.dk/OLD/undervisning/2005e/224/papers/Wand80.pdf">–›</a>
 </p>
 <a id="Waters-_00281979_0029"></a><p>Waters, Richard C.  1979.  A method for analyzing loop programs.
 <cite><abbr>IEEE</abbr> Transactions on Software Engineering</cite> 5(3): 237-247.

sicp-pocket.texi

@@ -37374,7 +37374,7 @@ Systems---Programming Language---Common Lisp}.
 @anchor{Appel 1987}
 Appel, Andrew W.  1987.  Garbage collection can be faster than stack
 allocation.  @cite{Information Processing Letters} 25(4): 275-279.
-@url{http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8219, –›}
+@url{https://www.cs.princeton.edu/~appel/papers/45.ps, –›}
 
 @anchor{Backus 1978}
 Backus, John.  1978.  Can programming be liberated from the von Neumann style?
@@ -37670,7 +37670,7 @@ North-Holland.
 @anchor{Lamport (1978)}
 Lamport, Leslie. 1978.  Time, clocks, and the ordering of events in a
 distributed system.  @cite{Communications of the @abbr{ACM}} 21(7): 558-565.
-@url{http://www.stanford.edu/class/cs240/readings/lamport.pdf, –›}
+@url{http://research.microsoft.com/en-us/um/people/lamport/pubs/time-clocks.pdf, –›}
 
 @anchor{Lampson et al. 1981}
 Lampson, Butler, J. J. Horning, R.  London, J. G. Mitchell, and G. K.  Popek.
@@ -37864,7 +37864,7 @@ reference manual.  Memo 203@abbr{A}, @abbr{MIT} Artificial Intelligence Laborato
 @anchor{Sutherland (1963)}
 Sutherland, Ivan E.  1963.  @abbr{SKETCHPAD}: A man-machine graphical
 com@-mu@-ni@-cation system.  Technical report 296, @abbr{MIT} Lincoln Laboratory.
-@url{http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4290, –›}
+@url{https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-574.pdf, –›}
 
 @anchor{Teitelman 1974}
 Teitelman, Warren.  1974.  Interlisp reference manual.  Technical report, Xerox
@@ -37885,7 +37885,7 @@ in Computer Science, volume 123. New York: Springer-Verlag, pp.  334-348.
 @anchor{Wand 1980}
 Wand, Mitchell.  1980.  Continuation-based program transformation strategies.
 @cite{Journal of the @abbr{ACM}} 27(1): 164-180.
-@url{http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.8567, –›}
+@url{http://www.diku.dk/OLD/undervisning/2005e/224/papers/Wand80.pdf, –›}
 
 @anchor{Waters (1979)}
 Waters, Richard C.  1979.  A method for analyzing loop programs.