From 3a9394baf8dd1b6c519edb410ebd043d37c49392 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Daniel=20Hillerstr=C3=B6m?= Date: Fri, 1 Jul 2022 01:19:43 +0100 Subject: [PATCH] Fix a minor typo --- thesis.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/thesis.tex b/thesis.tex index 0f44bc9..c0e7cf4 100644 --- a/thesis.tex +++ b/thesis.tex @@ -21514,7 +21514,7 @@ $\BergerCount$ program alluded to in Section~\ref{sec:pure-counting}, in order to fill out our overall picture of the relationship between language expressivity and potential program efficiency. -\paragraph{Relation to prior work} This appendix imported from +\paragraph{Relation to prior work} This appendix is imported from Appendix D of \citet{HillerstromLL20a}. The code snippets in this appendix are based on an implementation of Berger count in SML/NJ written by John Longley. I have transcribed the code snippets, and in