WIP

macros.tex

@@ -235,6 +235,7 @@
 
 \newcommand{\concat}{\mathbin{+\!\!+}}
 \newcommand{\revconcat}{\mathbin{\widehat{\concat}}}
+\newcommand{\snoc}[2]{\ensuremath{#1 \concat [#2]}}
 
 %%
 %% CPS notation
@@ -541,3 +542,95 @@
     }
 ;
 \end{tikzpicture}}
+
+%%
+%% Asymptotic improvement macros
+%%
+\newcommand{\naive}{naïve\xspace}
+\newcommand{\naively}{naïvely\xspace}
+\newcommand{\Naive}{Naïve\xspace}
+\newcommand{\sem}[1]{\ensuremath{\pi_{#1}}}
+\newcommand{\Iff}{\Leftrightarrow}
+\newcommand{\Implies}{\Rightarrow}
+\newcommand{\BCalcS}{\ensuremath{\lambda_{\textrm{\normalfont s}}\xspace}}
+\newcommand{\BCalcE}{\ensuremath{\lambda_{\textrm{\normalfont e}}\xspace}}
+\newcommand{\BCalcSE}{\ensuremath{\lambda_{\textrm{\normalfont se}}\xspace}}
+\newcommand{\IfZero}{\keyw{ifzero}}
+\newcommand{\Superpoint}{\lambda\_.\Do\;\Branch~\Unit}
+\newcommand{\ECount}{\dec{effcount}}
+\newcommand{\Countprog}{K}
+\newcommand{\Plus}{\mathsf{Plus}}
+\newcommand{\Minus}{\mathsf{Minus}}
+\newcommand{\Eq}{\mathsf{Eq}}
+\newcommand{\BList}{\mathbb{B}^\ast}
+
+\newcommand{\CtxCat}{\CatName{Ctx}}
+\newcommand{\PureCont}{\mathsf{PureCont}}
+
+\newcommand{\Addr}{\mathsf{Addr}}
+\newcommand{\Lab}{\mathsf{Lab}}
+\newcommand{\Env}{\mathsf{Env}}
+
+\newcommand{\Time}{\dec{DTIME}}
+\newcommand{\query}{\mathord{?}}
+\newcommand{\ans}{\mathord{!}}
+\newcommand{\labs}{\mathsf{labs}}
+\newcommand{\steps}{\mathsf{steps}}
+
+\newcommand{\tree}{\tau}
+\newcommand{\tl}{\labs(\tree)}
+\newcommand{\ts}{\steps(\tree)}
+\newcommand{\T}[1]{\ensuremath{\mathcal{T}_{#1}}}
+\newcommand{\Config}{\dec{Config}}
+\newcommand{\cekl}{\langle}
+\newcommand{\cekr}{\rangle}
+
+\newcommand{\const}[1]{\ulcorner #1 \urcorner}
+\newcommand{\HC}{\ensuremath{\mathcal{H}}}
+
+\newcommand{\tr}{\mathcal{T}}
+\newcommand{\tru}{\mathcal{U}}
+\newcommand{\Tree}{\dec{Tree}}
+\newcommand{\TimedTree}{\dec{TimedTree}}
+\newcommand{\denotep}[1]{\ensuremath{\mathbb{P}\llbracket #1 \rrbracket}}
+
+\newcommand\ttTwoTree{
+\begin{tikzpicture}[->,>=stealth',level/.style={sibling distance = 4cm/##1,
+  level distance = 2.0cm}]
+\node (root) [opnode] {Branch}
+  child { node [opnode] {Branch}
+    child { node [leaf] {$\True$}
+      edge from parent node[above left] {$\True$}
+    }
+    child { node [leaf] {$\True$}
+      edge from parent node[above right] {$\False$}
+    }
+    edge from parent node[above left] {$\True$}
+  }
+  child { node [opnode] {Branch}
+    child { node [leaf] {$\True$}
+      edge from parent node[above left] {$\True$}
+    }
+    child { node [leaf] {$\True$}
+      edge from parent node[above right] {$\False$}
+    }
+    edge from parent node[above right] {$\False$}
+  }
+;
+\end{tikzpicture}}
+
+
+\newcommand{\tossTree}{
+  \begin{tikzpicture}[->,>=stealth',level/.style={sibling distance = 2.5cm/##1,
+      level distance = 1.0cm}]
+\node (root) [opnode] {$\dec{Branch}$}
+  child { node [leaf] {$\dec{Heads}$}
+    edge from parent node[above left] {$\True$}
+  }
+  child { node [leaf] {$\dec{Tails}$}
+    edge from parent node[above right] {$\False$}
+  }
+;
+\end{tikzpicture}}
+
+\newenvironment{twoeqs}{\ba[t]{@{}r@{~}c@{~}l@{~}c@{~}r@{~}c@{~}l@{}}}{\ea}

thesis.bib

@@ -2902,3 +2902,165 @@
   pages     = {141--144},
   year      = {1986}
 }
+
+# Exact real integration
+@inproceedings{Simpson98,
+  author    = {Alex K. Simpson},
+  title     = {Lazy Functional Algorithms for Exact Real Functionals},
+  booktitle = {{MFCS}},
+  series    = {Lecture Notes in Computer Science},
+  volume    = {1450},
+  pages     = {456--464},
+  publisher = {Springer},
+  year      = {1998}
+}
+
+# Robbie Daniels' MSc dissertation
+@MastersThesis{Daniels16,
+    author     =     {Robbie Daniels},
+    title      =     {Efficient Generic Searches and Programming Language Expressivity},
+    school     =     {School of Informatics, the University of Edinburgh},
+    address    =     {Scotland},
+    month      =     aug,
+    year       =     2016,
+    OPTurl        = {http://homepages.inf.ed.ac.uk/jrl/Research/Robbie_Daniels_MSc_dissertation.pdf}
+}
+
+# Computability
+@article{Plotkin77,
+  author    =  {Gordon Plotkin},
+  title     =  {{LCF} considered as a programming language},
+  journal   =  {Theor. Comput. Sci.},
+  volume    =  {5},
+  number    =  {3},
+  pages     =  {223--255},
+  year      =  {1977}
+}
+
+@inproceedings{Pippenger96,
+  author    =  {Nicholas Pippenger},
+  title     =  {Pure versus impure Lisp},
+  booktitle =  {{POPL}},
+  pages     =  {104--109},
+  publisher =  {{ACM}},
+  year      =  {1996}
+}
+
+@inproceedings{Longley99,
+  author    =  {John Longley},
+  title     =  {When is a functional program not a functional program?},
+  booktitle =  {{ICFP}},
+  pages     =  {1--7},
+  publisher =  {{ACM}},
+  year      =  {1999}
+}
+
+@article{Longley18a,
+  author    =  {John Longley},
+  title     =  {The recursion hierarchy for {PCF} is strict},
+  journal   =  {Logical Methods in Comput. Sci.},
+  volume    =  {14},
+  number    =  {3:8},
+  pages     =  {1--51},
+  year      =  {2018}
+}
+
+@article{Longley19,
+  author    = {John Longley},
+  title     = {Bar recursion is not computable via iteration},
+  journal   = {Computability},
+  volume    = {8},
+  number    = {2},
+  pages     = {119--153},
+  year      = {2019}
+}
+
+@article{BirdJdM97,
+   author   =  {Richard Bird and
+                Geraint Jones and
+		Oege de Moor},
+   title    =  {More haste less speed: lazy versus eager evaluation},
+   journal  =  {J. Funct. Program.},
+   volume   =  {7},
+   number   =  {5},
+   pages    =  {541--547},
+   year     =  {1997}
+}
+
+@article{Jones01,
+   author   =  {Neil Jones},
+   title    =  {The expressive power of higher-order types, or, life without {CONS}},
+   journal  =  {J. Funct. Program.},
+   volume   =  {11},
+   pages    =  {5--94},
+   year     =  {2001}
+}
+
+# n-queens
+@article{BellS09,
+  author    = {Jordan Bell and
+               Brett Stevens},
+  title     = {A survey of known results and research areas for n-queens},
+  journal   = {Discret. Math.},
+  volume    = {309},
+  number    = {1},
+  pages     = {1--31},
+  year      = {2009}
+}
+
+# Sudoko
+@article{Bird06,
+  author    = {Richard S. Bird},
+  title     = {Functional Pearl: {A} program to solve Sudoku},
+  journal   = {J. Funct. Program.},
+  volume    = {16},
+  number    = {6},
+  pages     = {671--679},
+  year      = {2006}
+}
+
+# Environment-store model
+@article{ScottS71,
+  author  = {Dana Scott and Christopher Strachey},
+  journal = {Proceedings of the Symposium on Computers and Automata},
+  series  = {Microwave Research Institute Symposia Series},
+  volume  = {21},
+  year    = {1971}
+}
+
+# Backtracking
+@article{KiselyovSFA05,
+  author    = {Kiselyov, Oleg and Shan, Chung-chieh and Friedman, Daniel P. and Sabry, Amr},
+  title     = {Backtracking, Interleaving, and Terminating Monad Transformers: (Functional Pearl)},
+  booktitle = {{ICFP}},
+  pages     = {192--203},
+  publisher = {{ACM}},
+  year      = {2005},
+}
+
+# Ulrich Berger's PhD thesis
+@phdthesis{Berger90,
+    author = {Ulrich Berger},
+    title  = {Totale Objekte und Mengen in der Bereichstheorie},
+    school = {Ludwig Maximillians-Universtität},
+    address = {Munich},
+    year   = {1990}
+}
+
+# Exhaustive search on infinite sets
+@inproceedings{Escardo07,
+  author    = {Mart{\'{\i}}n H{\"{o}}tzel Escard{\'{o}}},
+  title     = {Infinite sets that admit fast exhaustive search},
+  booktitle = {{LICS}},
+  pages     = {443--452},
+  publisher = {{IEEE} Computer Society},
+  year      = {2007}
+}
+
+@misc{Bauer11,
+  author    = {Andrej Bauer},
+  title     = {How make the "impossible" functionals run even faster},
+  howpublished = {{M}athematics, {A}lgorithms and {P}roofs, Leiden, the Netherlands},
+  year      = 2011,
+  url       = {http://math.andrej.com/2011/12/06/how-to-make-the-impossible-functionals-run-even-faster/}
+}