Merge pull request #7 from bwignall/bibliography

Links to bibliography

Author: bwignall

12-barcode-recognition.org

@@ -1297,15 +1297,15 @@ impressively thorough.
 
 *** Further reading
 
-The book [[[file:bibliography.html#bib.okasaki99][Okasaki99]]] gives a wonderful and thorough implementor's
+The book [[[file:bibliography.org::Okasaki99][Okasaki99]]] gives a wonderful and thorough implementor's
 tour of many pure functional data structures, including several
 kinds of balanced tree. It also provides valuable insight into
 reasoning about the performance of purely functional data
 structures and lazy evaluation.
 
 We recommend Okasaki's book as essential reading for functional
 programmers. If you're not convinced, Okasaki's PhD thesis,
-[[[file:bibliography.html#bib.okasaki96][Okasaki96]]], is a less complete and polished version of the book,
+[[[file:bibliography.org::Okasaki96][Okasaki96]]], is a less complete and polished version of the book,
 and it is available for free online.
 
 ** Turning digit soup into an answer

2-types-and-functions.org

@@ -1307,7 +1307,7 @@ return the first element of the pair.
 There is a deep mathematical sense in which any non-pathological
 function of type (a,b) -> a must do exactly what ~fst~ does.
 Moreover, this line of reasoning extends to more complicated
-polymorphic functions. The paper [[[file:bibliography.html#bib.wadler89][Wadler89]]] covers this procedure
+polymorphic functions. The paper [[[file:bibliography.org::Wadler89][Wadler89]]] covers this procedure
 in depth.
 
 ** The type of a function of more than one argument

24-concurrent-and-multicore-programming.org

@@ -1691,7 +1691,7 @@ using a single core, and 0.361 with two (using ~+RTS -N2~).
 *** Finding the most popular URLs
 
 In this example, we count the number of times each URL is
-accessed. This example comes from [[[file:bibliography.html#bib.google08][Google08]]], Google's original
+accessed. This example comes from [[[file:bibliography.org::Google08][Google08]]], Google's original
 paper discussing MapReduce. In the /map/ phase, for each chunk, we
 create a ~Map~ from URL to the number of times it was accessed. In
 the /reduce/ phase, we union-merge these maps into one.

26-building-a-bloom-filter.org

@@ -59,7 +59,7 @@ bit ~1~ in the bit array. It is set, as is bit ~3~, so we say that
 positive.
 
 For a survey of some of the uses of Bloom filters in networking,
-see [[[file:bibliography.html#bib.broder02][Broder02]]].
+see [[[file:bibliography.org::Broder02][Broder02]]].
 
 ** Use cases and package layout
 

4-functional-programming.org

@@ -1836,7 +1836,7 @@ use ~foldl'~.
 
 *** Further reading
 
-The article [[[file:bibliography.html#bib.hutton99][Hutton99]]] is an excellent and deep tutorial covering
+The article [[[file:bibliography.org::Hutton99][Hutton99]]] is an excellent and deep tutorial covering
 folds. It includes many examples of how to use simple, systematic
 calculation techniques to turn functions that use explicit
 recursion into folds.

5-writing-a-library.org

@@ -1474,13 +1474,13 @@ example, but a much richer and more useful set of pretty printing
 functions. We recommend using it, rather than writing your own.
 
 The design of the ~HughesPJ~ pretty printer was introduced by John
-Hughes in [[[file:bibliography.html#bib.hughes95][Hughes95]]]. The library was subsequently improved by
+Hughes in [[[file:bibliography.org::Hughes95][Hughes95]]]. The library was subsequently improved by
 Simon Peyton Jones, hence the name. Hughes's paper is long, but
 well worth reading for his discussion of how to design a library
 in Haskell.
 
 In this chapter, our pretty printing library is based on a simpler
-system described by Philip Wadler in [[[file:bibliography.html#bib.wadler98][Wadler98]]]. His library was
+system described by Philip Wadler in [[[file:bibliography.org::Wadler98][Wadler98]]]. His library was
 extended by Daan Leijen; this version is available for download
 from Hackage as ~wl-pprint~. If you use the ~cabal~ command line
 tool, you can download, build, and install it in one step with

Makefile

@@ -25,3 +25,6 @@ typeclass:
 typecheck:
 	# No instances of "Typecheck"
 	sed -i 's/typecheck/type-check/g' *.org
+
+biblio:
+	sed -i 's/file:bibliography.html/file:bibliography.org/g' *.org

bibliography.org

@@ -1,42 +1,50 @@
 * Bibliography
 
+#+NAME: Broder02
 [Broder02] Andrei Broder. Michael Mitzenmacher.
 "[[http://www.eecs.harvard.edu/~michaelm/postscripts/im2005b.pdf][Network applications of Bloom filters: a survey]]".
 [[http://www.internetmathematics.org/][/Internet Mathematics/]].
 1. 4. 2005. 485-509.
 [[http://www.akpeters.com/][A K Peters Ltd.]].
 
+#+NAME: Google08
 [Google08] Jeffrey Dean. Sanjay Ghemawat.
 "[[http://labs.google.com/papers/mapreduce.html][MapReduce: simplified data processing on large clusters]]".
 [[http://cacm.acm.org/][/Communications of the ACM/]].
 51. 1. January 2008. 107-113.
 [[http://www.acm.org/][Association for Computing Machinery]]. 0956-7968.
 
+#+NAME: Hughes95
 [Hughes95] John Hughes.
 "[[http://citeseer.ist.psu.edu/hughes95design.html][The design of a pretty-printing library]]".
 May, 1995. First International Spring School on Advanced
 Functional Programming Techniques.
 Bastad, Sweden.
 
+#+NAME: Hutton99
 [Hutton99] Graham Hutton.
 "[[http://www.cs.nott.ac.uk/~gmh/fold.pdf][A tutorial on the universality and expressiveness of fold]]".
 [[http://journals.cambridge.org/jid_JFP][/Journal of Functional Programming/]].
 9. 4. July 1999. 355-372.
 [[http://www.cambridge.org/][Cambridge University Press]]. 0956-7968.
 
+#+NAME: Okasaki99
 [Okasaki99] Chris Okasaki.
 /Purely Functional Data Structures/.
 [[http://www.cambridge.org/][Cambridge University Press]]. 0521663504.
 
+#+NAME: Okasaki96
 [Okasaki96] Chris Okasaki.
 [[http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf][/Purely Functional Data Structures/]]. Carnegie Mellon University.
-This is Okasaki's PhD thesis, a less complete precursor to [[[file:bibliography.html#bib.okasaki99][Okasaki99]]]
+This is Okasaki's PhD thesis, a less complete precursor to [[[Okasaki99][Okasaki99]]]
 
+#+NAME: Wadler89
 [Wadler89] Philip Wadler.
 "[[http://citeseer.ist.psu.edu/wadler89theorems.html][Theorems for free!]]".
 September, 1989.
 International Conference on Functional Programming and Computer
 Architecture.
 4. London, England.
 
+#+NAME: Wadler98
 [Wadler98] Philip Wadler. "[[http://citeseer.ist.psu.edu/wadler98prettier.html][A prettier printer]]". March 1998.