Make the URL a link instead.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@156655 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/docs/ReleaseNotes.html b/docs/ReleaseNotes.html
index dc71f5199d8cfeac8fc0504dab0043d5519f7087..1f2e2684d6e7fa72a8faf17ff9de45242dd0dfa4 100644 (file)
--- a/docs/ReleaseNotes.html
+++ b/docs/ReleaseNotes.html
@@ -282,17 +282,17 @@ Release Notes</a>.</h1>
 
 <div>
 
-<p>Pure (http://pure-lang.googlecode.com/) is an algebraic/functional
-   programming language based on term rewriting. Programs are collections of
-   equations which are used to evaluate expressions in a symbolic fashion. The
-   interpreter uses LLVM as a backend to JIT-compile Pure programs to fast
-   native code. Pure offers dynamic typing, eager and lazy evaluation, lexical
-   closures, a hygienic macro system (also based on term rewriting), built-in
-   list and matrix support (including list and matrix comprehensions) and an
-   easy-to-use interface to C and other programming languages (including the
-   ability to load LLVM bitcode modules, and inline C, C++, Fortran and Faust
-   code in Pure programs if the corresponding LLVM-enabled compilers are
-   installed).</p>
+<p><a href="http://pure-lang.googlecode.com/">Pure</a> is an
+   algebraic/functional programming language based on term rewriting. Programs
+   are collections of equations which are used to evaluate expressions in a
+   symbolic fashion. The interpreter uses LLVM as a backend to JIT-compile Pure
+   programs to fast native code. Pure offers dynamic typing, eager and lazy
+   evaluation, lexical closures, a hygienic macro system (also based on term
+   rewriting), built-in list and matrix support (including list and matrix
+   comprehensions) and an easy-to-use interface to C and other programming
+   languages (including the ability to load LLVM bitcode modules, and inline C,
+   C++, Fortran and Faust code in Pure programs if the corresponding
+   LLVM-enabled compilers are installed).</p>
 
 <p>Pure version 0.54 has been tested and is known to work with LLVM 3.1 (and
    continues to work with older LLVM releases >= 2.5).</p>