copy edit references

book.tex

@@ -17,6 +17,7 @@
 %\usepackage{ifthen}
 \usepackage{upquote}
 \usepackage[all]{xy}
+\usepackage{url}
 
 \definecolor{lightgray}{gray}{1}
 \newcommand{\black}[1]{{\color{black} #1}}
@@ -100,6 +101,9 @@ showstringspaces=false
 \def\ShowFrameLinethickness{0.125pt}
 
 \addbibresource{book.bib}
+\if\edition\pythonEd
+\addbibresource{python.bib}
+\fi
 
 \begin{document}
 
@@ -5039,7 +5043,6 @@ Figure~\ref{fig:satur-algo} gives the pseudocode for a simple greedy
 algorithm for register allocation based on saturation and the
 most-constrained-first heuristic. It is roughly equivalent to the
 DSATUR graph coloring algorithm~\citep{Brelaz:1979eu}.
-%,Gebremedhin:1999fk,Omari:2006uq
 Just as in sudoku, the algorithm represents colors with integers. The
 integers $0$ through $k-1$ correspond to the $k$ registers that we use
 for register allocation. The integers $k$ and larger correspond to

python.bib

@@ -0,0 +1,71 @@
+@book{Barry:2016vj,
+	author = {Paul Barry},
+	publisher = {O'Reilly},
+	title = {Head First Python},
+	year = {2016}}
+
+@book{Matthes:2019vs,
+	author = {Eric Matthes},
+	edition = {2nd edition},
+	publisher = {No Starch Press},
+	title = {Python Crash Course},
+	year = {2019}}
+
+@Misc{PSF21:cpython,
+  title = 	 {Python {GitHub} {Repository}},
+  organization = {Python Software Foundation},
+  year = 	 2021
+}
+
+@Manual{PSF21:python_ref,
+  title = 	 {The Python Language Reference},
+  organization = {Python Software Foundation},
+  year = 	 2021
+}
+
+@book{Lutz:2013vp,
+	author = {Mark Lutz},
+	edition = {5th edition},
+	publisher = {O'Reilly},
+	title = {Learning Python},
+	year = {2013}
+}
+
+@book{Sweigart:2019vn,
+	author = {Al Sweigart},
+	publisher = {No Starch Press},
+	title = {Automate the Boring Stuff with Python},
+	year = {2019}}
+
+@inproceedings{Dieckmann99,
+  author    = {Sylvia Dieckmann and Urs H{\"{o}}lzle},
+  title     = {A Study of the Allocation Behavior of the SPECjvm98 Java Benchmark},
+  booktitle = {Proceedings of the 13th European Conference on Object-Oriented Programming},
+  series    = {Lecture Notes in Computer Science},
+  volume    = 1628,
+  pages     = {92--115},
+  publisher = {Springer},
+  year      = 1999
+}
+
+@article{Dunfield:2021,
+author = {Dunfield, Jana and Krishnaswami, Neel},
+title = {Bidirectional Typing},
+year = 2021,
+issue_date = {June 2022},
+publisher = {Association for Computing Machinery},
+volume = 54,
+number = 5,
+journal = {ACM Comput. Surv.},
+articleno = 98,
+numpages = 38,
+keywords = {type inference, Type checking}
+}
+
+@Misc{Lehtosalo2021:MyPy,
+  author = 	 {Jukka Lehtosalo},
+  title = 	 {MyPy Optional Type Checker for Python},
+  url = {http://mypy-lang.org/},
+  year = 	 2021
+}
+