Forráskód Böngészése

trying out MIT class file

Jeremy Siek 4 éve
szülő
commit
51edeb34e8
6 módosított fájl, 5221 hozzáadás és 13 törlés
  1. 1943 0
      TimesAPriori_MIT.cls
  2. 124 13
      all.bib
  3. 374 0
      bibsamp.bib
  4. 1335 0
      book-MIT.bib
  5. 1380 0
      book-MIT.tex
  6. 65 0
      multind.sty

+ 1943 - 0
TimesAPriori_MIT.cls

@@ -0,0 +1,1943 @@
+\newcommand\classname{TimesAPriori_MIT}
+\newcommand\lastmodifieddate{2020/07/23}
+\newcommand\versionnumber{0.1}
+
+% Are we printing crop marks?
+\newif\if@cropmarkson \@cropmarksontrue
+\newif\ifsixbynine \sixbyninetrue%6x9 inches, fixed by default
+\newif\ifsevenbyten%7x9
+\newif\ifsevenbytenwide%7x9
+\newif\ifeightbyten%8x9
+\newif\ifappendon%
+\newif\ifthmcountchapter%
+\newif\ifthmcountcont%
+
+\newif\if@aheadpresent\global\@aheadpresentfalse%used for unnumbered heads
+\newif\if@bheadpresent\global\@bheadpresentfalse%
+
+\NeedsTeXFormat{LaTeX2e}
+\ProvidesClass{\classname}[\lastmodifieddate\space\versionnumber]
+
+\setlength{\paperheight}{9truein}%
+\setlength{\paperwidth}{6truein}%
+
+\DeclareOption{draft}{\PassOptionsToPackage{draft}{graphicx}}
+\DeclareOption{a4paper}{\PassOptionsToPackage{a4}{crop}}
+\DeclareOption{centre}{\PassOptionsToPackage{center}{crop}}
+\DeclareOption{crop}{\PassOptionsToPackage{cam}{crop}\global\@cropmarksontrue}
+\DeclareOption{nocrop}{\PassOptionsToPackage{off}{crop}\global\@cropmarksonfalse}
+\DeclareOption{info}{\PassOptionsToPackage{info}{crop}}
+\DeclareOption{noinfo}{\PassOptionsToPackage{noinfo}{crop}}
+%%Trim Sizes%%
+\DeclareOption{6x9}{\global\sixbyninetrue}
+\DeclareOption{7x10}{\global\sevenbytentrue}
+\DeclareOption{7x10wide}{\global\sevenbytenwidetrue}
+\DeclareOption{8x10}{\global\eightbytentrue%
+\PassOptionsToPackage{width=9truein,height=11truein,cam}{crop}%
+}%
+%%Numbers like Theorem 1.1, Lemma 1.1, etc.
+\DeclareOption{thmnumcontwithchapter}{\global\thmcountchaptertrue}
+%%Numbers like Theorem 1.1, Lemma 1.2, etc.
+\DeclareOption{thmnumcont}{\global\thmcountconttrue}%
+
+\ExecuteOptions{a4paper,crop,centre,info}
+
+\ProcessOptions
+
+\ifsixbynine%
+\setlength{\paperheight}{9truein}%
+\setlength{\paperwidth}{6truein}%
+\fi%
+
+\ifsevenbyten%
+\setlength{\paperheight}{10truein}%
+\setlength{\paperwidth}{7truein}%
+\fi%
+
+\ifsevenbytenwide%
+\setlength{\paperheight}{10truein}%
+\setlength{\paperwidth}{7truein}%
+\fi%
+
+\ifeightbyten%
+\setlength{\paperheight}{10truein}%
+\setlength{\paperwidth}{8truein}%
+\fi%
+
+% Load all necessary packages
+\usepackage{ifxetex,ifluatex}%
+\RequirePackage[T1]{fontenc}%
+\ifxetex\relax\else%
+\RequirePackage{times}%
+\RequirePackage[defaultmathsizes,italic]{mathastext}\fi%
+\ifluatex\relax\else%
+\RequirePackage{times}%
+\RequirePackage[defaultmathsizes,italic]{mathastext}\fi%
+\RequirePackage{crop,graphicx,amsmath,amsthm,amsfonts,makeidx,array,floatpag}%
+\RequirePackage{framed,stfloats,courier}%
+\RequirePackage[figuresright]{rotating}%
+\RequirePackage{adjustbox}%
+\RequirePackage{titlecaps}%
+\Addlcwords{the of into that for in and a with in}%%
+
+%\usepackage{ifluatex}%
+%\usepackage{ifxetex}%
+%\ifxetex%
+
+% Not sure if needed.
+\newcommand\@ptsize{0}
+
+% Set twoside printing
+\@twosidetrue 
+
+% Marginal notes are on the outside edge
+\@mparswitchtrue
+
+% Default font sizes
+\def\aboveskip{%
+\abovedisplayskip=0pt%
+\abovedisplayshortskip=0pt%
+}%
+
+\renewcommand\normalsize{%
+   \@setfontsize\normalsize{10\p@}{13\p@}%
+   \abovedisplayskip 7\p@%
+   \abovedisplayshortskip \z@%
+   \belowdisplayshortskip 3.5\p@%
+   \belowdisplayskip 7\p@%
+   \let\@listi\@listI}%
+\normalsize%
+\let\@bls\baselineskip%
+
+\newcommand\small{%
+   \@setfontsize\small{9\p@}{11\p@}%
+   \abovedisplayskip 8.5\p@%
+   \abovedisplayshortskip \z@%
+   \belowdisplayshortskip 4\p@%
+   \def\@listi{\leftmargin\leftmargini
+               \topsep 4\p@%
+               \parsep 2\p@%
+               \itemsep \parsep}%
+   \belowdisplayskip \abovedisplayskip
+}
+
+\newcommand\footnotesize{%
+   \@setfontsize\footnotesize{8\p@}{9.5\p@}%
+   \abovedisplayskip 6\p@%
+   \abovedisplayshortskip \z@%
+   \belowdisplayshortskip 3\p@%
+   \def\@listi{\leftmargin\leftmargini
+               \topsep 3\p@%
+               \parsep 2\p@%
+               \itemsep \parsep}%
+   \belowdisplayskip 6\p@
+}
+
+\newcommand\scriptsize{\@setfontsize\scriptsize\@viipt\@viiipt}
+\newcommand\tiny{\@setfontsize\tiny\@vpt\@vipt}
+%\newcommand\little{\@setfontsize\tiny\@ixpt\@ixpt}
+\newcommand\large{\@setfontsize\large\@xiipt{14}}
+\newcommand\Large{\@setfontsize\Large\@xivpt{18}}
+\newcommand\LARGE{\@setfontsize\LARGE\@xviipt{22}}
+\newcommand\huge{\@setfontsize\huge\@xxpt{25}}
+\newcommand\Huge{\@setfontsize\Huge\@xxvpt{30}}
+
+\DeclareOldFontCommand{\rm}{\normalfont\rmfamily}{\mathrm}
+\DeclareOldFontCommand{\sf}{\normalfont\sffamily}{\mathsf}
+\DeclareOldFontCommand{\tt}{\normalfont\ttfamily}{\mathtt}
+\DeclareOldFontCommand{\bf}{\normalfont\bfseries}{\mathbf}
+\DeclareOldFontCommand{\it}{\normalfont\itshape}{\mathit}
+\DeclareOldFontCommand{\sl}{\normalfont\slshape}{\@nomath\sl}
+\DeclareOldFontCommand{\sc}{\normalfont\scshape}{\@nomath\sc}
+
+% Line spacing
+\setlength\lineskip{1\p@}
+\setlength\normallineskip{1\p@}
+\renewcommand\baselinestretch{}
+
+% Paragraph dimensions and inter-para spacing
+\setlength\parskip{0\p@}
+\setlength\parindent{10\p@}
+
+% Set inter-para skips
+\setlength\smallskipamount{3.25\p@}
+\setlength\medskipamount{6.5\p@}
+\setlength\bigskipamount{13\p@}
+
+% Page break penalties
+\@lowpenalty   51
+\@medpenalty  151
+\@highpenalty 301
+
+% Disallow widows and orphans
+\clubpenalty 10000
+\widowpenalty 10000
+
+% Disable page breaks before equations, allow pagebreaks after
+% equations and discourage widow lines before equations.
+\displaywidowpenalty 100
+\predisplaypenalty   10000
+\postdisplaypenalty  0
+
+% Allow breaking the page in the middle of a paragraph
+\interlinepenalty 0
+
+% Disallow breaking the page after a hyphenated line
+\brokenpenalty 10000
+
+% Hyphenation; don't split words into less than three characters
+\lefthyphenmin=3
+\righthyphenmin=3
+
+\ifxetex
+\RequirePackage{mathptmx}%
+\usepackage{fontspec}%
+\defaultfontfeatures{Ligatures=TeX}%
+\setmainfont[Mapping=tex-text,Path = ./fonts/ ,
+UprightFont= TimesLTStd-Roman,
+BoldFont= TimesLTStd-Bold,
+ItalicFont=TimesLTStd-Italic,
+BoldItalicFont=TimesLTStd-BoldItalic
+]{TimesLTStd-Roman}%
+\setsansfont[Mapping=tex-text,Path = ./fonts/ ,
+%Scale=MatchLowercase,
+UprightFont= SyntaxLTStd-Roman,
+BoldFont=SyntaxLTStd-Bold,
+ItalicFont=SyntaxLTStd-Italic,
+]{SyntaxLTStd-Roman}
+\fi
+
+\ifluatex
+\RequirePackage{mathptmx}%
+\usepackage{fontspec}%
+\defaultfontfeatures{Ligatures=TeX}%
+\setmainfont[Mapping=tex-text,Path = ./fonts/ ,
+UprightFont= TimesLTStd-Roman,
+BoldFont= TimesLTStd-Bold,
+ItalicFont=TimesLTStd-Italic,
+BoldItalicFont=TimesLTStd-BoldItalic
+]{TimesLTStd-Roman}%
+\setsansfont[Mapping=tex-text,Path = ./fonts/ ,
+%Scale=MatchLowercase,
+UprightFont= SyntaxLTStd-Roman,
+BoldFont=SyntaxLTStd-Bold,
+ItalicFont=SyntaxLTStd-Italic,
+]{SyntaxLTStd-Roman}
+\fi
+
+\usepackage{tikz}%
+\def\slant#1#2{%
+  \tikz[baseline=(X.base), xslant=tan(#1)]%
+    \node[inner sep=0pt, xslant=tan(#1)](X){#2};%
+}%
+\newcommand{\sfbfit}[1]{\slant{15}{\fontsize{9}{13}\selectfont\sansbold{#1}}}%15 degree slant
+
+%%Sansbold definitions
+\newcommand{\sansbold}[1]{\textbf{\textsf{#1}}}%
+%%
+
+%
+% Set page layout dimensions
+%
+\setlength\headheight{8\p@}         % height of running head
+\setlength\topmargin{34\p@}         % head margin
+\addtolength\topmargin{-1in}        % subtract out the 1 inch driver margin
+
+\setlength\topskip{10\p@}           % height of first line of text
+\AtBeginDocument{\setlength{\topskip}{\fontcharht\font`T}}%
+\setlength\headsep{40\p@}           % space below running head --
+\addtolength\headsep{-\topskip}     %   base to base with first line of text
+
+\setlength\footskip{\z@}            % space above footer line
+\setlength\maxdepth{.5\topskip}     % pages can be short or deep by half a line?
+
+\ifsixbynine
+\setlength\textwidth{26pc}          % text measure excluding margins
+\fi
+
+\ifsevenbyten%
+\setlength\textwidth{30pc}          % text measure excluding margins
+\fi
+
+\ifsevenbytenwide
+\setlength\textwidth{30pc}          % text measure excluding margins
+\fi
+
+\ifeightbyten%
+\setlength\textwidth{30pc}          % text measure excluding margins
+\fi
+
+\ifsixbynine
+\setlength\textheight{39\baselineskip} % 40 lines on a full page,
+\addtolength\textheight{\topskip}      %    including the first
+\fi                                       %    line on the page
+
+\ifsevenbyten
+\setlength\textheight{44\baselineskip} % 45 lines on a full page,
+\addtolength\textheight{\topskip}      %    including the first
+\fi                                       %    line on the page
+
+\ifsevenbytenwide
+\setlength\textheight{44\baselineskip} % 45 lines on a full page,
+\addtolength\textheight{\topskip}      %    including the first
+\fi                                       %    line on the page
+
+\ifeightbyten
+\setlength\textheight{44\baselineskip} % 45 lines on a full page,
+\addtolength\textheight{\topskip}      %    including the first
+\fi                                       %    line on the page
+
+% Set the margins
+% Margin paras are not required. Set lengths to zero.
+\ifsixbynine
+\setlength\marginparsep{18\p@}
+\setlength\marginparpush{6\p@}
+\setlength\marginparwidth{40\p@}
+\fi
+
+\ifsevenbyten
+\setlength\marginparsep{\z@}%
+\setlength\marginparpush{\z@}%
+\setlength\marginparwidth{48\p@}%
+\fi
+
+\ifsevenbytenwide
+\setlength\marginparsep{18\p@}
+\setlength\marginparpush{6\p@}
+\setlength\marginparwidth{40\p@}
+\fi
+
+\ifeightbyten
+\setlength\marginparsep{\z@}
+\setlength\marginparpush{\z@}
+\setlength\marginparwidth{72\p@}
+\fi
+
+%%%
+\ifsixbynine
+\setlength\oddsidemargin{5pc}
+\addtolength\oddsidemargin{-1in}    % subtract out the 1 inch driver margin
+\setlength\@tempdima{\paperwidth}
+\addtolength\@tempdima{-\textwidth}
+\addtolength\@tempdima{-5pc}
+\setlength\evensidemargin{\@tempdima}
+\addtolength\evensidemargin{-1in}
+\fi
+
+\ifsevenbyten
+\setlength\oddsidemargin{6pc}
+\addtolength\oddsidemargin{-1in}    % subtract out the 1 inch driver margin
+\setlength\@tempdima{\paperwidth}
+\addtolength\@tempdima{-\textwidth}
+\addtolength\@tempdima{-6pc}
+\setlength\evensidemargin{\@tempdima}
+\addtolength\evensidemargin{-1in}
+\fi
+
+\ifsevenbytenwide%
+\setlength\oddsidemargin{6pc}
+\addtolength\oddsidemargin{-1in}    % subtract out the 1 inch driver margin
+\setlength\@tempdima{\paperwidth}
+\addtolength\@tempdima{-\textwidth}
+\addtolength\@tempdima{-6pc}
+\setlength\evensidemargin{\@tempdima}
+\addtolength\evensidemargin{-1in}
+\fi
+
+\ifeightbyten%
+\setlength\oddsidemargin{9pc}
+\addtolength\oddsidemargin{-1in}    % subtract out the 1 inch driver margin
+\setlength\@tempdima{\paperwidth}
+\addtolength\@tempdima{-\textwidth}
+\addtolength\@tempdima{-9pc}
+\setlength\evensidemargin{\@tempdima}
+\addtolength\evensidemargin{-1in}
+\fi
+
+\setlength\columnsep{0\p@}          % space between columns for double-column text
+\setlength\columnseprule{0\p@}      % width of rule between two columns
+
+% Footnotes
+\setlength\footnotesep{8\p@}     % space between footnotes
+% space between text and footnote
+\setlength{\skip\footins}{18\p@}%
+
+% Float placement parameters
+
+% The total number of floats that can be allowed on a page.
+\setcounter{totalnumber}{10}
+% The maximum number of floats at the top and bottom of a page.
+\setcounter{topnumber}{5}
+\setcounter{bottomnumber}{5}
+% The maximum part of the top or bottom of a text page that can be
+% occupied by floats. This is set so that at least four lines of text 
+% fit on the page.
+\renewcommand\topfraction{.921}
+\renewcommand\bottomfraction{.921}
+% The minimum amount of a text page that must be occupied by text.
+% This should accomodate four lines of text.
+\renewcommand\textfraction{.079}
+% The minimum amount of a float page that must be occupied by floats.
+\renewcommand\floatpagefraction{.887}
+
+% The same parameters repeated for double column output
+\renewcommand\dbltopfraction{.88}
+\renewcommand\dblfloatpagefraction{.88}
+
+% Space between floats
+\setlength\floatsep    {12\p@}
+% Space between floats and text
+\setlength\textfloatsep{20\p@}
+% Space above and below an inline figure
+\setlength\intextsep   {18\p@}
+
+% For double column floats
+\setlength\dblfloatsep    {12\p@}% \@plus 2\p@ \@minus 2\p@}
+\setlength\dbltextfloatsep{20\p@}% \@plus 2\p@ \@minus 4\p@}
+
+% Space left at top, bottom and inbetween floats on a float page.
+\setlength\@fptop{0\p@}         % no space above float page figures
+\setlength\@fpsep{12\p@}% \@plus 2fil}
+\setlength\@fpbot{0\p@}% \@plus 1fil}
+
+% The same for double column
+\setlength\@dblfptop{0\p@}
+\setlength\@dblfpsep{12\p@}% \@plus 1fil}
+\setlength\@dblfpbot{0\p@}% \@plus 2fil}
+
+% Page styles
+%\sodef\track{}{.15em}{0.333em}{0pt}
+
+  \def\ps@headings{%
+      \let\@oddfoot\@empty\let\@evenfoot\@empty
+      \def\@evenhead{%
+\fontsize{8\p@}{8\p@}\selectfont{\sansbold{\thepage}}\hfill{%
+\if@mainmatter{\sansbold{\chaptername~\thechapter}}\else\sansbold{\leftmark\vphantom{y}}\fi}}%
+      \def\@oddhead{\fontsize{8\p@}{8\p@}\selectfont{\sansbold{\vphantom{y}\rightmark}}\hfill{\sansbold{\thepage}}
+}%
+      \let\@mkboth\markboth
+    \def\chaptermark##1{\markboth{##1}{##1}}%
+}
+
+\def\ps@plain{%
+\let\@oddfoot\relax \let\@evenfoot\relax
+%  \def\@oddfoot{\hfill{{\fontsize{10\p@}{12\p@}\selectfont\thepage}}}%
+  \let\@evenfoot\@oddfoot%
+  \let\@oddhead\relax \let\@evenhead\relax}%
+                                                                    
+%          
+% Sectional units
+%
+
+% Lowest level heading that takes a number by default
+\setcounter{secnumdepth}{3}
+    
+% Counters
+\newcounter{part}
+\newcounter{chapter}
+\newcounter{section}[chapter]
+\newcounter{subsection}[section]
+\newcounter{subsubsection}[subsection]
+\newcounter{paragraph}[subsubsection]
+\newcounter{subparagraph}[paragraph]
+\newcounter{figure}[chapter]
+\newcounter{table}[chapter]
+
+
+% Form of the numbers
+\newcommand\thepage{\arabic{page}}
+\renewcommand\thepart{\Roman{part}}
+\renewcommand\thechapter{\arabic{chapter}}
+\renewcommand\thesection{\thechapter.\arabic{section}}
+\renewcommand\thesubsection{\thesection.\arabic{subsection}}
+\renewcommand\thesubsubsection{\thesubsection.\arabic{subsubsection}}%
+\renewcommand\theparagraph{\thesubsubsection.\arabic{paragraph}}
+\renewcommand\thesubparagraph{\theparagraph.\arabic{subparagraph}}
+\renewcommand\theequation{\thechapter.\arabic{equation}}
+\newcommand\@chapapp{\chaptername}
+
+% Form of the words
+\newcommand\contentsname{Contents}
+\newcommand\listfigurename{List of Figures}
+\newcommand\listtablename{List of Tables}
+\newcommand\partname{Part}
+\newcommand\chaptername{Chapter}
+\newcommand\appendixname{Application}
+\newcommand\abstractname{Abstract}
+\newcommand\refname{References}
+\newcommand\bibname{Bibliography}
+\newcommand\indexname{Index}
+\newcommand\figurename{Figure}
+\newcommand\tablename{Table}
+
+% Clearemptydoublepage should really clear the running heads too
+\newcommand{\clearemptydoublepage}{\newpage{\pagestyle{empty}\cleardoublepage}}
+
+% Frontmatter, mainmatter and backmatter
+
+\newif\if@mainmatter \@mainmattertrue
+
+\newcommand\frontmatter{%
+  \clearpage
+  \@mainmatterfalse
+  \pagenumbering{roman}}
+
+\newcommand{\HalfTitle}[1]{\thispagestyle{empty}\bgroup\parindent\z@\raggedright%
+\null\vspace{-12\p@}%
+\fontsize{12\p@}{14\p@}\selectfont%
+\sansbold{#1}\par%
+\egroup\clearpage}%
+
+\newcommand{\halftitlepage}{}%
+
+\def\seriespage{\thispagestyle{empty}\parindent=0pt\parskip=0pt
+\def\title##1{\vskip6pt{\it##1}}
+\def\author##1{\vskip1sp{\rm ##1}}
+}
+\def\endseriespage{\newpage}
+\def\seriestitle#1{{\normalsize\sansbold{MIT PRESS BOOK SERIES}\\[12pt] \sansbold{#1}}}
+\def\serieseditor#1{\vskip1sp{\normalsize\rm  #1}\vspace{7\p@}}
+
+\newcommand{\Title}[1]{\thispagestyle{empty}\bgroup\parindent\z@\raggedright%
+\fontsize{12\p@}{14\p@}\selectfont%
+\sansbold{#1\vphantom{y}}\par%
+\egroup}%
+
+\newcommand{\Booksubtitle}[1]{\thispagestyle{empty}\bgroup\parindent\z@\raggedright%
+\fontsize{10\p@}{14\p@}\selectfont%
+\sansbold{#1\vphantom{y}}\par%
+\egroup}%
+
+\newcommand{\edition}[1]{\bgroup\parindent\z@\raggedright%
+\vspace{7.5\p@}%
+\normalsize%
+\sansbold{#1\vphantom{y}}\par%
+\egroup}%
+
+\newcommand{\BookAuthor}[1]{\bgroup\parindent\z@\raggedright%
+%\vspace{58\p@}%
+\vspace{96\p@}%
+\normalsize%
+\sansbold{#1\vphantom{y}}\par%
+\egroup}
+
+\newcommand{\imprint}[1]{\bgroup\parindent\z@\raggedright%
+\vfill%
+\small\sf#1\par%
+\egroup\newpage}%
+
+\newenvironment{copyrightpage}{\thispagestyle{empty}\bgroup\parindent\z@%
+\raggedright%
+\fontsize{8\p@}{9.5\p@}\selectfont%
+\null\vspace{122\p@}\setlength{\parskip}{12.5\p@}%
+}{\par\egroup\newpage}%
+
+\newcommand{\dedication}[1]{\thispagestyle{empty}\bgroup\parindent\z@\raggedright%
+\null\vspace{132\p@}%
+\normalsize%
+#1\par%
+\egroup}
+
+\def\startonoddpage{\clearpage
+\ifodd\c@page\else\null\thispagestyle{empty}\newpage\fi}
+
+\newenvironment{epigraphpage}{\thispagestyle{empty}%
+\startonoddpage\bgroup%
+\null\vspace{125\p@}%
+\small%
+}{\egroup\thispagestyle{empty}\newpage}%
+
+\def\epigraph#1#2{\vskip8pt\noindent{\small#1\vphantom{y}}\vskip1sp%
+\noindent{\small\rm ---#2}\vskip1pt}%
+
+\def\endchapepigraph{\vspace{2\baselineskip}\@afterheading\@afterindentfalse}%
+
+\newif\iftwocolcontributors
+\def\contributors{\@ifnextchar[{\global\twocolcontributorstrue
+\addcontentsline{toc}{fmbm}{Contributors}%
+\xcontributors}{\ycontributors}}
+
+\def\ycontributors{\startonoddpage\parindent=0pt\parskip=3pt\thispagestyle{empty}
+\chapter*{Contributors}%
+}
+
+\def\endcontributors{\vskip1sp
+\iftwocolcontributors\def\go{\end{multicols}}\else\let\go\relax\fi\go
+\newpage}
+
+\def\contrib#1\\{\vskip1sp{\sansbold{#1}}\\
+}
+
+\def\xcontributors[#1]{\startonoddpage\parindent=0pt\parskip=3pt\thispagestyle{empty}
+\chapter*{Contributors}
+\columnsep=1pc
+\hyphenpenalty=10000
+\raggedright
+\begin{multicols}{2}[\vspace*{-12\p@}]}
+
+%%%
+\newcommand\mainmatter{%
+  \clearpage
+  \@mainmattertrue
+  \pagenumbering{arabic}}
+
+\newcommand\backmatter{%
+  \clearpage
+  \@mainmatterfalse}
+
+\def\part{\clearpage\thispagestyle{empty}\global\@topnum\z@
+  \secdef\@part\@spart}
+
+\def\@part[#1]#2{%
+  \ifnum \c@secnumdepth >\m@ne
+    \refstepcounter{part}
+%    \typeout{^^J\@chapapp\space\arabic{chapter}:}
+    \addcontentsline{toc}{part}{\protect\numberline{\thepart}#2}
+  \else
+    \addcontentsline{toc}{part}{#2}
+  \fi
+  \@makeparthead{#2}
+  \@afterindentfalse
+  \@afterheading}
+        
+\def\@spart#1{%
+  \thispagestyle{empty}
+  \@makesparthead{#1}
+  \@afterindentfalse
+  \@afterheading}
+
+\def\chapter{\clearpage\startonoddpage\thispagestyle{plain}\global\@topnum\z@
+  \secdef\@chapter\@schapter}
+
+\def\@chapter[#1]#2{%
+  \ifnum \c@secnumdepth >\m@ne
+    \refstepcounter{chapter}
+    \typeout{^^J\@chapapp\space\arabic{chapter}:}
+    \addcontentsline{toc}{chapter}{\protect\numberline{\thechapter}#2}
+  \else
+    \addcontentsline{toc}{chapter}{#2}
+  \fi
+  \chaptermark{#1}
+  \@makechapterhead{#2}
+  \@afterindentfalse
+  \@afterheading\chapterauthor{}\notenum=0%
+}
+        
+\def\@schapter#1{%
+  \chaptermark{#1}
+  \thispagestyle{plain}
+  \@makeschapterhead{#1}
+  \@afterindentfalse
+  \@afterheading}
+
+\def\@makeparthead#1{% 
+  \begingroup%
+    \parindent\z@\raggedright%
+\null\vspace{-10.5\p@}%
+\adjustbox{valign=t}{%
+\begin{tabular}[t]{@{}l@{}}
+\fontsize{31.4\p@}{31.4\p@}\selectfont\sansbold{\thepart}%
+\end{tabular}}\ignorespaces\hspace{22\p@}\ignorespaces%
+\adjustbox{valign=t}{%
+\begin{tabular}[t]{@{}P{270\p@}@{}}%
+\noalign{\vskip-1.5\p@}%
+    {\fontsize{11\p@}{14\p@}\selectfont\sansbold{\uppercase{#1}}\par}%
+\end{tabular}}%
+  \endgroup
+  \@afterindentfalse
+  \@afterheading
+\clearemptydoublepage%
+}
+
+\def\partintro{\startonoddpage%
+\bgroup%
+\setcounter{secnumdepth}{0}%
+\thispagestyle{empty}%
+\normalsize%
+}
+
+\def\endpartintro{\egroup\newpage%
+\setcounter{secnumdepth}{3}%
+}%
+
+\def\partintrotitle#1{\section*{#1}%
+\addcontentsline{toc}{section}{#1}%
+}
+
+\let\@chapterauthor\@empty%
+\def\chapterauthor#1{\def\@chapterauthor{#1}}%
+
+\def\@makechapterhead#1{% 
+  \begingroup%
+    \parindent\z@\raggedright%
+\null\vspace{-7.5\p@}%
+\vbox to 138\p@{%
+\adjustbox{valign=t}{%
+\begin{tabular}[t]{@{}l@{}}%
+\fontsize{31\p@}{31\p@}\selectfont\sansbold{\thechapter}%
+\end{tabular}}\ignorespaces\hspace{21\p@}\ignorespaces%
+\adjustbox{valign=t}{%
+\begin{tabular}[t]{@{}P{270\p@}@{}}%
+\noalign{\vskip-1.5\p@}%
+    {\fontsize{11\p@}{14\p@}\selectfont\sansbold{#1}\vphantom{y}\par}\\%
+\ifx\@chapterauthor\@empty\relax\else%
+\noalign{\vskip1\p@}\addcontentsline{toc}{contributor}{\@chapterauthor}\fi%
+ {\fontsize{9\p@}{14\p@}\selectfont\sansbold{\@chapterauthor\vphantom{y}}\par}%
+\end{tabular}}\par%
+%\medskip
+%    {\fontsize{11}{13}\selectfont\centering\@subtitle\par}%
+%\bigskip%
+%    {\fontsize{11}{13}\fontshape{it}\selectfont\centering\@author\par}%
+\vfill}%
+  \endgroup%
+  \@afterindentfalse
+  \@afterheading}
+
+\def\abstract{\vskip9pt\bgroup\small\noindent{\sansbold{Abstract.}}\ignorespaces\hspace{9\p@}\ignorespaces}%
+\def\endabstract{\vskip1sp\egroup\vskip9pt}%
+
+%%%%Appendix Chapter Title
+\def\@makeappchapterhead#1{% 
+  \begingroup%
+    \parindent\z@\raggedright%
+\null\vspace{-7.5\p@}%
+\vbox to 138\p@{%
+\adjustbox{valign=t}{%
+\begin{tabular}[t]{@{}l@{}}%
+\fontsize{31\p@}{31\p@}\selectfont\sansbold{\thechapter}%
+\end{tabular}}\ignorespaces\hspace{24\p@}\ignorespaces%
+\adjustbox{valign=t}{%
+\begin{tabular}[t]{@{}P{255\p@}@{}}%
+    {\fontsize{11\p@}{14\p@}\selectfont\sansbold{#1}\vphantom{y}\par}\\%
+\ifx\@chapterauthor\@empty\relax\else%
+\noalign{\vskip1\p@}\addcontentsline{toc}{contributor}{\@chapterauthor}\fi%
+ {\fontsize{9\p@}{14\p@}\selectfont\sansbold{\@chapterauthor\vphantom{y}}\par}%
+\end{tabular}}\par%
+%\medskip
+%    {\fontsize{11}{13}\selectfont\centering\@subtitle\par}%
+%\bigskip%
+%    {\fontsize{11}{13}\fontshape{it}\selectfont\centering\@author\par}%
+\vfill}%
+  \endgroup%
+  \@afterindentfalse
+  \@afterheading}
+
+  
+  \def\@makeschapterhead#1{%
+  \begingroup\parindent\z@\raggedright%
+\null\vspace{-6.5\p@}%
+\vbox to 137.5\p@{%
+    {\fontsize{11\p@}{14\p@}\selectfont\sansbold{#1\vphantom{y}}\par}%
+\vfill}%
+  \endgroup%
+  \@afterindentfalse%
+  \@afterheading}%
+
+
+% Section macros
+
+% \@sect redefined to write the long entry to the TOC
+\def\@sect#1#2#3#4#5#6[#7]#8{%
+  \ifnum #2>\c@secnumdepth
+    \let\@svsec\@empty
+  \else
+    \refstepcounter{#1}%
+    \protected@edef\@svsec{\@seccntformat{#1}\relax}%
+  \fi
+  \@tempskipa #5\relax
+  \ifdim \@tempskipa>\z@
+    \ifnum#2=1%
+    \begingroup
+      #6{%
+        \@hangfrom{\hskip #3\relax\@svsec}%
+          \interlinepenalty \@M \titlecap{\sansbold{#8}} \@@par}%
+    \endgroup\else
+    \begingroup
+      #6{%
+        \@hangfrom{\hskip #3\relax\@svsec}%
+          \interlinepenalty \@M \sansbold{#8} \@@par}%
+    \endgroup\fi
+    \csname #1mark\endcsname{#7}%
+    \addcontentsline{toc}{#1}{%
+      \ifnum #2>\c@secnumdepth \else
+        \protect\numberline{\csname the#1\endcsname}%
+      \fi
+      #8}%
+  \else
+    \def\@svsechd{%
+      #6{\hskip #3\relax
+      \@svsec #8}%
+      \csname #1mark\endcsname{#7}%
+      \addcontentsline{toc}{#1}{%
+        \ifnum #2>\c@secnumdepth \else
+          \protect\numberline{\csname the#1\endcsname}%
+        \fi
+        #8}}%
+  \fi
+  \@xsect{#5}}
+
+\def\@ssect#1#2#3#4#5{\@tempskipa #3\relax
+   \ifdim \@tempskipa>\z@
+     \begingroup
+         %\ifnum#1=3%
+%         #4\@hangfrom{\hskip #1}%
+%         {\interlinepenalty \@M {#5}\par}
+%         \else%
+         \if@aheadpresent\global\@aheadpresenttrue%
+         #4\@hangfrom{\hskip #1}%
+         {\interlinepenalty \@M {{\sansbold{#5}}\par}}
+         \else
+         \if@bheadpresent\global\@bheadpresenttrue%
+         #4\@hangfrom{\hskip #1}%
+         {\interlinepenalty \@M {{\sansbold{#5}}}\par}
+         \else
+         #4\@hangfrom{\hskip #1}%
+         {\interlinepenalty \@M \sansbold{#5}\par}
+         \fi%
+         \fi%
+%         \fi%
+         \endgroup%
+   \else
+      \def\@svsechd{#4\hskip #1\relax #5\@afterhead}\fi
+    \@xsect{#3}\global\@aheadpresentfalse\global\@bheadpresentfalse}
+
+\newdimen\bsecdimen%
+\bsecdimen=13pt%%%
+
+\newdimen\asecdimen%
+\asecdimen=13pt%
+
+\renewcommand{\@seccntformat}[1]{{\sansbold{\csname the#1\endcsname}\ignorespaces\hspace{9pt}\ignorespaces}}
+\newcommand\section{\@startsection {section}{1}{\z@}%
+                                   {-\bsecdimen}%
+                                   {\asecdimen}
+{\fontsize{9\p@}{13\p@}\selectfont\raggedright}}
+
+\newdimen\bsubsecdimen% B and C level above spaces are same
+\bsubsecdimen=13pt%%
+
+\newdimen\asubsecdimen%
+\asubsecdimen=0.01pt%%
+
+\newcommand\subsection{\@startsection{subsection}{2}{\z@}%
+                                     {-\bsubsecdimen}%
+                                     {\asubsecdimen}%
+{\fontsize{9\p@}{13\p@}\selectfont\raggedright}}
+
+\newcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
+                                     {-\bsubsecdimen}%
+                                     {\asubsecdimen}%
+{\fontsize{9\p@}{13\p@}\selectfont\raggedright}}
+
+\newcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
+                                     {-7\p@}%
+                                     {-9\p@}%
+{%\fontsize{10\p@}{13\p@}
+\fontsize{9}{13}\sansbold\selectfont\raggedright}}
+
+\newcommand\subparagraph{\@startsection{subparagraph}{5}{\z@}%
+                                     {-7\p@}%
+                                     {-9\p@}%
+{\fontsize{9\p@}{13\p@}\selectfont\raggedright}}
+
+\newlength\abovecaptionskip
+\newlength\belowcaptionskip
+\setlength\abovecaptionskip{6\p@}
+\setlength\belowcaptionskip{\z@}
+
+\long\def\@makecaption#1#2{\vspace{\abovecaptionskip}%
+\fontsize{8\p@}{9.5\p@}\selectfont%
+  \setbox\@tempboxa=\hbox{#1\ignorespaces\hspace{1em}\ignorespaces#2}%
+  {\sansbold{#1}}\par#2%
+}
+
+\long\def\@tablecaption#1#2{\fontsize{8\p@}{9\p@}\selectfont%
+{\sansbold{#1}}\par{#2\strut}\par
+  \vspace{\belowcaptionskip}}
+
+\newcommand{\tabfont}{\fontsize{8}{12}\selectfont}%
+
+\newcommand{\notename}{Notes{\em:}}
+
+% Top rule
+\RequirePackage{threeparttable,booktabs}%
+
+\def\hrulefill{\leavevmode\leaders\hrule height .50pt\hfill\kern\z@}
+
+\def\thefigure{\thechapter.\@arabic\c@figure}
+\def\fps@figure{tbp}
+\def\ftype@figure{1}
+\def\ext@figure{lof}
+\def\fnum@figure{\figurename~\thefigure}
+\def\figure{\@float{figure}}
+\def\endfigure{\end@float}
+\@namedef{figure*}{\@dblfloat{figure}}
+\@namedef{endfigure*}{\end@dblfloat}
+\def\thetable{\thechapter.\@arabic\c@table}
+\def\fps@table{tbp}
+\def\ftype@table{2}
+\def\ext@table{lot}
+\def\fnum@table{\tablename~\thetable}
+\def\table{\let\@makecaption\@tablecaption\@float{table}}
+\let\endtable\end@float
+\@namedef{table*}{\let\@makecaption\@tablecaption\@dblfloat{table}}
+\@namedef{endtable*}{\end@dblfloat}
+
+\newif\if@rotate \@rotatefalse
+\newif\if@rotatecenter \@rotatecenterfalse
+\def\rotatecenter{\global\@rotatecentertrue}
+\def\rotateendcenter{\global\@rotatecenterfalse}
+\def\rotate{\global\@rotatetrue}
+\def\endrotate{\global\@rotatefalse}
+\newdimen\rotdimen
+\def\rotstart#1{\special{ps: gsave currentpoint currentpoint translate
+    #1 neg exch neg exch translate}}
+\def\rotfinish{\special{ps: currentpoint grestore moveto}}
+\def\rotl#1{\rotdimen=\ht#1\advance\rotdimen by \dp#1
+    \hbox to \rotdimen{\vbox to\wd#1{\vskip \wd#1
+    \rotstart{270 rotate}\box #1\vss}\hss}\rotfinish}
+\def\rotr#1{\rotdimen=\ht #1\advance\rotdimen by \dp#1
+    \hbox to \rotdimen{\vbox to \wd#1{\vskip \wd#1
+    \rotstart{90 rotate}\box #1\vss}\hss}\rotfinish}
+
+\newdimen\tempdime
+\newbox\temptbox
+\newenvironment{processtable}[3]{\setbox\temptbox=\hbox{\fontsize{9\p@}{11\p@}\selectfont{#2}}%
+\tempdime\wd\temptbox\@processtable{#1}{#2}{#3}{\tempdime}}
+{\relax}
+
+\newenvironment{@processtable}[4]{%
+\if@rotate
+\setbox4=\vbox to \textwidth{\vss\hbox to \textheight{\hss%
+\begin{minipage}{#4}%
+\fontsize{9\p@}{10\p@}\selectfont
+\caption{#1}{#2}%
+\vskip4pt\noindent
+\parbox{#4}{\fontsize{8\p@}{10\p@}\selectfont #3\par}%
+\end{minipage}}\vss}%
+\else
+\setbox4=\hbox to \textwidth{\vbox{\begin{center}\begin{minipage}[t]{#4}%
+\fontsize{9\p@}{10\p@}\selectfont
+\caption{#1}{#2}%
+\vskip4pt\noindent
+\parbox{#4}{\fontsize{8\p@}{10\p@}\selectfont #3\par}%
+\end{minipage}\end{center}}}%
+\fi
+\if@rotate\rotl{4}\else\box4\fi}
+{\relax}
+
+\newcolumntype{P}[1]{>{\raggedright\arraybackslash}p{#1}}%
+
+\newcommand{\colhead}[1]{\bgroup\selectfont#1\egroup}%
+
+% ******************************
+% List numbering and lettering *
+% ******************************
+\def\labelenumi{{\rm\arabic{enumi}.}}
+\def\theenumi{\arabic{enumi}}
+\def\labelenumii{{\rm \roman{enumii}.}}
+\def\theenumii{a\alph{enumii}}
+\def\p@enumii{\theenumi}
+\def\labelenumiii{({\rm\roman{enumiii}})}
+\def\theenumiii{\roman{enumiii}}
+\def\p@enumiii{\theenumi(\theenumii)}
+\def\labelenumiv{({\rm\Alph{enumiv}})}
+\def\theenumiv{\Alph{enumiv}}
+\def\p@enumiv{\p@enumiii\theenumiii}
+
+\newcommand{\alphlist}{%
+\def\labelenumi{{\rm\alph{enumi}}}%
+\def\theenumi{\alph{enumi}}%
+}
+
+\newcommand{\Alphlist}{%
+\def\labelenumi{{\rm\Alph{enumi}}}%
+\def\theenumi{\Alph{enumi}}%
+}
+
+\newcommand{\romanlist}{%
+\def\labelenumi{{\rm\roman{enumi}}}%
+\def\theenumi{\roman{enumi}}%
+}
+
+\newcommand{\Romanlist}{%
+\def\labelenumi{{\rm\Roman{enumi}}}%
+\def\theenumi{\Roman{enumi}}%
+}
+
+\def\labelitemi{\tiny\raise1.25pt\llap{$\bullet$}}%
+\def\labelitemii{--}%
+\def\labelitemiii{$\ast$}%
+\def\labelitemiv{$\cdot$}%
+
+      
+\setlength\leftmargini   {\z@}%
+\leftmargin  \leftmargini
+\setlength\leftmarginii  {\z@}
+\setlength\leftmarginiii {\z@}
+\setlength\leftmarginiv  {\z@}
+\setlength\leftmarginv   {\z@}
+\setlength\leftmarginvi  {\z@}
+
+\setlength\partopsep{\z@}
+\setlength  \labelsep  {.5em}
+\setlength  \labelwidth{\leftmargini}
+\addtolength\labelwidth{-\labelsep}
+
+\def\@listi{\leftmargin\leftmargini
+            %\parsep 4\p@ \@plus2\p@ \@minus\p@
+            \topsep 7\p@%
+            %\itemsep4\p@ \@plus2\p@ \@minus\p@
+            }
+\let\@listI\@listi
+\@listi
+\def\@listii {\leftmargin\leftmarginii
+              \labelwidth\leftmarginii
+              \advance\labelwidth-\labelsep
+              \topsep   1\p@% 4\p@ \@plus2\p@ \@minus\p@
+              \parsep    \z@%
+              \itemsep   \parsep}
+\def\@listiii{\leftmargin\leftmarginiii
+              \labelwidth\leftmarginiii
+              \advance\labelwidth-\labelsep
+              \topsep    \z@%
+              \parsep    \z@
+              \partopsep \p@%
+              \itemsep   \topsep}
+\def\@listiv {\leftmargin\leftmarginiv
+              \labelwidth\leftmarginiv
+              \advance\labelwidth-\labelsep}
+\def\@listv  {\leftmargin\leftmarginv
+              \labelwidth\leftmarginv
+              \advance\labelwidth-\labelsep}
+\def\@listvi {\leftmargin\leftmarginvi
+              \labelwidth\leftmarginvi
+              \advance\labelwidth-\labelsep}
+
+\def\enumargs{%
+   \partopsep     \z@
+   \itemsep       1\p@
+   \parsep        \z@
+   \labelsep      0.5em
+   \rightmargin   \z@
+   \listparindent \parindent
+   \itemindent    \z@}
+
+\def\enumerate{%
+    \@ifnextchar[{\@numerate}{\@numerate[0.]}}
+
+\def\@numerate[#1]{%
+     \ifnum \@enumdepth >3 \@toodeep\else
+     \advance\@enumdepth \@ne
+     \edef\@enumctr{enum\romannumeral\the\@enumdepth}
+     \list{\csname label\@enumctr\endcsname}{%
+       \enumargs
+       \setlength{\leftmargin}{\csname leftmargin\romannumeral\the\@enumdepth\endcsname}
+       \usecounter{\@enumctr}
+       \settowidth\labelwidth{#1}
+       \addtolength{\leftmargin}{\labelwidth}
+       \addtolength{\leftmargin}{\labelsep}
+       \def\makelabel##1{\hss\llap{##1}}}%
+     \fi
+   }
+\let\endenumerate\endlist
+
+
+% Changes to the list parameters for itemize
+\def\itemargs{%
+   \partopsep     \z@
+   \itemsep       1\p@
+   \parsep        \z@
+   \labelsep      0.5em
+   \rightmargin   \z@
+   \listparindent \parindent
+   \itemindent    \z@}
+
+\def\itemize{%
+   \@ifnextchar[{\@itemize}{\@itemize[$\bullet$]}}
+
+\def\@itemize[#1]{%
+     \ifnum \@itemdepth >3 \@toodeep\else
+     \advance\@itemdepth \@ne
+     \edef\@itemctr{item\romannumeral\the\@itemdepth}
+     \list{\csname label\@itemctr\endcsname}{%
+       \itemargs
+       \setlength{\leftmargin}{\csname leftmargin\romannumeral\the\@itemdepth\endcsname}
+       \settowidth\labelwidth{#1}
+       \addtolength{\leftmargin}{\labelwidth}
+       \addtolength{\leftmargin}{\labelsep}
+       \def\makelabel##1{\hss \llap{##1}}}%
+     \fi
+   }
+\let\enditemize\endlist
+
+\def\unargs{%
+   \partopsep     \z@
+   \itemsep       \z@
+   \labelwidth    \z@
+   \parsep        \z@
+   \labelsep      \z@
+   \rightmargin   \z@
+   \listparindent \parindent
+   \leftmargin 12pt
+   \itemindent -6pt}
+
+\newenvironment{unlist}{%
+\begin{list}{}{%
+  \unargs%
+  }}{\end{list}}
+
+\newenvironment{description}
+               {\list{}{\leftmargin10\p@\itemsep1\p@\labelwidth\z@ \itemindent-\leftmargin
+                        \let\makelabel\descriptionlabel}}
+               {\endlist}
+\newcommand*\descriptionlabel[1]{\hspace\labelsep
+                                \normalfont\sansbold{#1}}
+\newenvironment{verse}
+               {\let\\\@centercr
+                \list{}{\itemsep      \z@
+                        \itemindent   -1.5em%
+                        \listparindent\itemindent
+                        \rightmargin  \leftmargin
+                        \advance\leftmargin 1.5em}%
+                \item\relax}
+               {\endlist}
+\newenvironment{quotation}
+               {\list{}{\listparindent 1.5em%
+                        \itemindent    \listparindent
+                        \rightmargin   \leftmargin
+                        \parsep        \z@}%
+                \item\relax}
+               {\endlist}
+\def\extitemargs{%
+\topsep 9\p@%
+   \partopsep     \z@%
+   \itemsep       5\p@%
+   \parsep        \z@%
+   \labelsep      0.5em%
+   \rightmargin   \z@%
+   \listparindent \parindent%
+   \itemindent    \z@}%
+
+\newenvironment{quote}
+               {\list{}{\topsep4\p@\leftmargin15pt\rightmargin15\p@\itemindent-5.25\p@\listparindent9\p@}%
+                \small\let\itemargs\extitemargs%
+                \item\relax}%
+               {\endlist}
+\let\extract\quote%
+\let\endextract\endquote%
+
+\newenvironment{enotequote}
+               {\list{}{\topsep4\p@\leftmargin18pt\rightmargin15\p@\itemindent-5.25\p@\listparindent9\p@\parsep\z@}%
+                \footnotesize\let\itemargs\extitemargs%
+                \item\relax}%
+               {\endlist}
+
+\newenvironment{appquote}
+               {\list{}{\topsep2\p@\leftmargin15pt\rightmargin15\p@\itemindent-5.25\p@}%
+                \fontsize{8\p@}{9.5\p@}\selectfont%
+                \item\relax}%
+               {\endlist}
+
+\skip\@mpfootins = \skip\footins
+\fboxsep=6\p@
+\fboxrule=1\p@
+
+%%Boxed text%%
+%% Boxed Text
+\newcounter{boxtextnum}
+\@addtoreset{boxtextnum}{chapter}
+
+
+\def\bsection#1{\global\advance\c@section by 1
+\vskip1sp\vspace{4\p@}\noindent{\fontsize{8}{9}\selectfont\sansbold{\thesection}\hskip4pt
+\sansbold{#1}}\\ }
+
+\def\csection#1{\vskip1sp\noindent{\fontsize{8}{9}\selectfont\sansbold{#1}}\\ }
+\def\csubsection#1{\vskip1sp\noindent{\fontsize{8}{9}\selectfont\sansbold{#1}}\\ }
+\def\csubsubsection#1{\vskip1sp\noindent{\fontsize{8}{9}\selectfont\sansbold{#1}}\\ }
+
+\def\bsubsection#1{\global\advance\c@subsection by 1
+\vskip1sp\vspace{4\p@}\noindent{\fontsize{8}{9}\selectfont\sansbold{\thesubsection}\hskip4pt
+\sansbold{#1}}\\ }
+
+\def\bsubsubsection#1{\global\advance\c@subsubsection by 1
+\vskip1sp\vspace{4\p@}\noindent{\fontsize{8}{9}\selectfont\sansbold{\thesubsubsection}\hskip4pt
+\sansbold{#1}}\\ }
+
+\def\xstar{*}
+
+\def\boxedtext#1{%
+\vskip12pt
+\def\paragraph{\@startsection{paragraph}{4}{\z@}%
+                                    {-1sp}%
+                                    {-1em}%
+                               {\reset@font\small\bfseries}}
+\c@section=0
+\c@subsection=0
+\c@subsubsection=0
+%%
+\def\thesection{\arabic{section}}
+\def\thesubsection{\thesection.\arabic{subsection}}
+\def\thesubsubsection{\thesubsection.\arabic{subsubsection}}
+\let\section\bsection
+\let\subsection\bsubsection
+\let\subsubsection\bsubsubsection
+\let\small\footnotesize%
+%%
+\def\section##1{\def\one{##1}\ifx\one\xstar\let\go\csection\else\def\go{\bsection{##1}}\fi\go}
+\def\subsection##1{\def\one{##1}\ifx\one\xstar\let\go\csubsection\else\def\go{\bsubsection{##1}}\fi\go}
+\def\subsubsection##1{\def\one{##1}\ifx\one\xstar\let\go\csubsubsection\else\def\go{\bsubsubsection{##1}}\fi\go}
+%%
+\def\extract{\vskip1sp\leftskip=12pt \rightskip\leftskip}
+\def\endextract{\vskip5pt}
+
+\global\advance\c@boxtextnum by 1
+\fboxsep=1pc \fboxrule=.5pt \framed\footnotesize
+\parskip=6pt \parindent=0pt
+\sansbold{Box \arabic{chapter}.\arabic{boxtextnum}\\
+#1
+\vskip3pt
+}}
+
+\def\endboxedtext{\endframed}
+%%%
+
+\definecolor{shadecolor}{cmyk}{0,0,0,0.20}%
+\newenvironment{shdadeboxedtext}{\begingroup%
+\begin{shaded}%
+\advance\hsize by -2\FrameSep%
+\@afterheading%
+}{\end{shaded}\endgroup}%
+
+%%
+\newenvironment{thebibliography}[1]
+     {\chapter*{\refname}%
+\addcontentsline{toc}{fmbm}{\refname}%
+      \list{\@biblabel{\@arabic\c@enumiv}}%
+           {\settowidth\labelwidth{\@biblabel{#1}}%
+            \leftmargin\labelwidth
+            \advance\leftmargin\labelsep
+            \@openbib@code
+            \usecounter{enumiv}%
+            \let\p@enumiv\@empty
+            \renewcommand\theenumiv{\@arabic\c@enumiv}}%
+      \clubpenalty10000
+      \@clubpenalty \clubpenalty
+      \widowpenalty10000%
+      \sfcode`\.\@m}
+     {\def\@noitemerr
+       {\@latex@warning{Empty `thebibliography' environment}}%
+      \endlist}
+\let\@openbib@code\@empty%
+
+\newenvironment{unnumbibliography}[1]{%
+ \chapter*{\refname}%
+\addcontentsline{toc}{fmbm}{\refname}%
+\normalsize\list{}{%
+  \usecounter{enumi}%
+  \leftmargin 1em\itemindent -1em\parsep \z@
+    \itemsep\z@%
+ }}%
+{\endlist}%
+
+
+\RequirePackage{multicol}
+
+\newif\if@restonecol
+\def\theindex{\@mainmatterfalse
+%  \addcontentsline{toc}{chapter}{Index}
+  \columnseprule \z@
+  \columnsep 12pt\begin{multicols*}{2}[\chapter*{\indexname}\vspace{-10\p@}] 
+                                %Subject or Author here
+  \markboth{\indexname}{\indexname}%
+  \parskip\z@\relax\let\item\idxitem\fontsize{8\p@}{9.5\p@}\selectfont}
+\def\idxitem{\par\noindent\raggedright\hangindent20\p@}%
+\def\subitem{\par\noindent\raggedright\hangindent20\p@\hspace*{10\p@}}%
+\def\subsubitem{\par\noindent\raggedright\hangindent20\p@\hspace*{15\p@}}%
+\def\endtheindex{\end{multicols*}}
+\def\indexspace{\par \vskip 12\p@\relax}
+\AtBeginDocument{%
+\def\printindex#1#2{\@restonecoltrue\if@twocolumn\@restonecolfalse\fi
+  \columnseprule \z@ \columnsep 12pt%
+  \newpage\startonoddpage %\twocolumn[{\Large\bf #2 \vskip4ex}]
+\begin{multicols*}{2}[\chapter*{#2}\vspace{-10\p@}]%
+  \addcontentsline{toc}{fmbm}{#2}
+  \@input{#1.ind}\end{multicols*}}
+%%
+\def\theindex{\@mainmatterfalse
+%  \addcontentsline{toc}{chapter}{Index}
+  \columnseprule \z@
+  \columnsep 12pt%\begin{multicols*}{2}[\chapter*{\indexname}] 
+                                %Subject or Author here
+  \markboth{\indexname}{\indexname}%
+  \parskip\z@\relax\let\item\idxitem\fontsize{8\p@}{9.5\p@}\selectfont}%
+\def\idxitem{\par\noindent\raggedright\hangindent20\p@}%
+\def\subitem{\par\noindent\raggedright\hangindent20\p@\hspace*{10\p@}}%
+\def\subsubitem{\par\noindent\raggedright\hangindent20\p@\hspace*{15\p@}}%
+\def\endtheindex{}%\end{multicols*}}
+\def\indexspace{\par \vskip 10\p@\relax}
+%%
+}%
+     
+% ***********
+% Footnotes *
+% ***********
+
+\renewcommand\footnoterule{\hbox to 12.5pc{\hrulefill}\par\removelastskip\nointerlineskip\vskip3.5pt\nointerlineskip}%
+
+\usepackage[splitrule]{footmisc}%
+  \def\splitfootnoterule{\kern-3\p@ \hbox to 0.5\textwidth{\hrulefill} \kern3.6\p@}
+
+\AtBeginDocument{\renewcommand\@makefntext[1]{%
+    \fontsize{8\p@}{9.5\p@}\selectfont\def\@textsuperscript{}%\global\baselineskip=9pt%
+    \parindent10pt%
+    \noindent\ignorespaces%\hspace*{10pt}\ignorespaces
+    \hbox{\@makefnmark.}\ignorespaces\hspace{4\p@}\ignorespaces#1}
+}%
+\def\@makefnmark{\hbox{\smash{\@textsuperscript{\normalfont\@thefnmark}}}}
+
+%%End Note Definition%%%
+\newcount\notenum
+\newcount\endnotenum
+
+\def\enotenumstyle{$^{\the\notenum}$}%
+\long\def\endnote#1{%%%% For notes at end of chapter
+\global\advance\notenum by 1\relax\leavevmode\enotenumstyle%\ [\the\notenum]%
+\global\advance\endnotenum by 1\relax%
+\long\expandafter\gdef\csname note\the\notenum\endcsname{%
+{\leftskip=1.5pc\small\hsize=\textwidth\relax%
+\noindent\llap{\hbox to 1.5pc{\the\notenum.\hfill}}%
+#1\strut\vskip1sp}\vskip1pt}%
+%%%% now for endnotes:
+\ifnum\notenum=1\relax%
+\immediate\write\@auxout{\string\expandafter\string\gdef\string\csname\space
+chapendnote\the\endnotenum\string\endcsname{%
+%% The commented out part Might be good, but malfunctioned on first small test.
+\ifnum\c@chapter>2 \string\newpage\fi
+\string\goodbreak\string\vskip14pt\string\penalty-8000%
+{\string\small\space %Notes for
+\ifnum\c@chapter>0
+\string\sansbold \string {\@chapapp \space
+\ifappendon\Alph{chapter}\else\arabic{chapter}\fi\string }%
+\else Frontmatter\fi}\string\vskip6pt\global\notenum=1}}\fi%
+\long\expandafter\gdef\csname endnote\the\endnotenum\endcsname{%
+{\leftskip=1.5pc\small\hsize=\textwidth\relax%
+\noindent\llap{\hbox to 1.5pc{\the\notenum.\hfill}}%
+#1\strut\vskip1sp}\vskip1pt}}
+
+\def\chapternotes{\ifnum\notenum>0
+\section*{\small\bfseries\itshape %Notes for 
+Chapter \arabic{chapter}}%
+%\markright{Notes for Chapter \arabic{chapter}}%
+\addcontentsline{toc}{section}{\protect\numberline{}Chapter Notes}%
+\parindent=0pt%
+\parskip=4pt%
+\notenum=0%
+\noindent\loop\global\advance\notenum by1\relax%
+\expandafter\ifx\csname note\the\notenum\endcsname\relax%
+\else%
+\csname note\the\notenum\endcsname\relax%
+\expandafter\gdef\csname note\the\notenum\endcsname{\relax}%
+\repeat%
+\fi%
+\global\notenum=0\relax%
+\vskip1sp%
+\leftskip=0pt\relax}%
+
+\def\theendnotes{\chapter*{Notes}%
+\addcontentsline{toc}{fmbm}{Notes}%
+\vspace{-19\p@}%
+\def\enotenumstyle{\ [\the\notenum]}%
+\markboth{Notes}{Notes}%
+\let\quote\enotequote%
+\let\endquote\endenotequote%
+\parindent=0pt%
+\parskip=4pt%
+\endnotenum=0%
+\noindent\loop\global\advance\endnotenum by1\relax%
+\global\advance\notenum by 1%
+\expandafter\ifx\csname endnote\the\endnotenum\endcsname\relax%
+\else%
+\expandafter\csname chapendnote\the\endnotenum\endcsname%
+\expandafter\csname endnote\the\endnotenum\endcsname%
+\repeat%
+\vskip1sp%
+\leftskip=0pt\relax}%
+
+%%%%
+
+\usepackage[natbib,authordate,backend=biber]{biblatex-chicago}%
+\AtEveryBibitem{\global\undef\bbx@lasthash}%
+\setlength{\bibhang}{5\p@}%
+\setlength{\bibitemsep}{3.5\p@}%
+%\setlength{\biblabelsep}{-10\p@}%
+\def\bibfont{\footnotesize}%
+%\setlength{\bibhang}{1cm}
+%%%
+\newlength{\bibleftadd}%
+\setlength{\bibleftadd}{-5\p@}%
+%%
+\defbibenvironment{bibliography}
+  {\vspace{-2\p@}\markboth{\bibname}{\bibname}\list%
+     {}%
+     {\setlength{\topsep}{\z@}\setlength{\leftmargin}{\bibhang}%
+      \setlength{\itemindent}{-\leftmargin}%
+      \addtolength{\leftmargin}{\bibleftadd}%
+      \setlength{\itemsep}{\bibitemsep}%
+      \setlength{\parsep}{\bibparsep}}}
+  {\endlist}
+  {\item}
+
+%Math parameters
+
+\setlength{\jot}{7\p@} 
+
+\def\frenchspacing{\sfcode`\.\@m \sfcode`\?\@m \sfcode`\!\@m
+  \sfcode`\:\@m \sfcode`\;\@m \sfcode`\,\@m}
+
+\def\@mathmargin{1.5pc}
+\vbadness=9999
+\tolerance=9999
+\doublehyphendemerits=10000
+\doublehyphendemerits 640000   % corresponds to badness 800
+\finalhyphendemerits  1000000  % corresponds to badness 1000
+
+% Table and array parameters
+\setlength\arraycolsep{.5em}
+\setlength\tabcolsep{.5em}
+\setlength\arrayrulewidth{.25pt}
+\setlength\doublerulesep{2.5pt}
+\renewcommand\arraystretch{1}
+
+\def\@fmbmdottedtocline#1#2#3#4#5{%
+  \renewcommand\@dotsep{1000}
+  \ifnum #1>\c@tocdepth \else
+    \vskip \z@ %
+    {\leftskip #2\relax \rightskip \@tocrmarg \parfillskip -\rightskip
+     \parindent #2\relax\@afterindenttrue
+     \interlinepenalty\@M
+     \leavevmode
+     \@tempdima #3\relax
+     \advance\leftskip \@tempdima \null\nobreak\hskip -\leftskip
+     {\fontsize{9\p@}{13\p@}\selectfont\sf#4}\nobreak
+     \leaders\hbox{$\m@th \mkern \@dotsep mu\hbox{.}\mkern \@dotsep
+        mu$}\hfill
+     \nobreak
+     \hb@xt@\@pnumwidth{\hfil\normalcolor\fontsize{9\p@}{13\p@}\selectfont\sf#5}%
+     \par}%
+  \fi}
+
+\def\@dottedtocline#1#2#3#4#5{%
+  \renewcommand\@dotsep{1000}%
+  \ifnum #1>\c@tocdepth \else%
+    \vskip \z@ %
+    {\leftskip #2\relax \rightskip \@tocrmarg \parfillskip -\rightskip%
+     \parindent #2\relax\@afterindenttrue%
+     \interlinepenalty\@M%
+     \leavevmode%
+     \@tempdima #3\relax%
+     \advance\leftskip \@tempdima \null\nobreak\hskip -\leftskip%
+\fontsize{9}{13}\selectfont%
+     {\fontsize{9}{13}\selectfont#4}\nobreak%
+     \leaders\hbox{$\m@th \mkern \@dotsep mu\hbox{.}\mkern \@dotsep%
+        mu$}\hfill%
+     \nobreak%
+     \hb@xt@\@pnumwidth{\hfil\normalcolor\fontsize{9}{13}\selectfont#5}%%
+     \par}%%
+  \fi}%
+
+
+\def\@contributordottedtocline#1#2#3#4#5{%
+    \renewcommand\@dotsep{1000}
+  \ifnum #1>\c@tocdepth \else
+    \vskip 0\p@ %
+    {\leftskip #2\relax \rightskip \@tocrmarg \parfillskip -\rightskip
+     \parindent #2\relax\@afterindenttrue
+     \interlinepenalty\@M
+     \leavevmode
+     \@tempdima #3\relax
+     \advance\leftskip \@tempdima \null\nobreak\hskip -\leftskip
+     {#4}\nobreak
+     \leaders\hbox{$\m@th \mkern \@dotsep mu\hbox{.}\mkern \@dotsep
+        mu$}\hfill
+  \nobreak
+     \hb@xt@\@pnumwidth{\hfil\normalcolor\normalsize}%
+     \par}%
+%\vspace{6pt}
+  \fi}
+
+
+\def\@chapterdottedtocline#1#2#3#4#5{%
+  \begingroup
+\def\numberline##1{\hb@xt@\@tempdima{{\sansbold{##1}}\hfil}}
+  \renewcommand\@dotsep{1000}
+  \ifnum #1>\c@tocdepth \else
+    \vskip 13pt\goodbreak
+    {\leftskip #2\relax   \rightskip \@tocrmarg \parfillskip -\rightskip
+     \parindent #2\relax\@afterindenttrue
+     \interlinepenalty\@M
+     \leavevmode
+     \@tempdima #3\relax
+     \advance\leftskip \@tempdima \null\nobreak\hskip -\leftskip
+\fontsize{9}{13}\selectfont%
+     {\fontsize{9}{13}\selectfont\sansbold{#4}}\nobreak
+     \leaders\hbox{$\m@th         \mkern \@dotsep mu\hbox{.}\mkern \@dotsep
+        mu$}\hfill
+      \nobreak
+     \hb@xt@\@pnumwidth{\hfil\normalcolor{\fontsize{9}{13}\selectfont#5}}%
+     \par}%
+  \endgroup
+  \fi}
+
+\def\@appendixdottedtocline#1#2#3#4#5{%
+  \begingroup
+  \renewcommand\@dotsep{1000}
+  \ifnum #1>\c@tocdepth \else
+    \vskip 9pt\goodbreak
+    {\leftskip #2\relax   \rightskip \@tocrmarg \parfillskip -\rightskip
+     \parindent #2\relax\@afterindenttrue
+     \interlinepenalty\@M
+     \leavevmode
+     \@tempdima #3\relax
+     \null\nobreak\hskip -\leftskip
+     {\bfseries #4}\nobreak
+     \leaders\hbox{$\m@th         \mkern \@dotsep mu\hbox{.}\mkern \@dotsep
+        mu$}\hfill
+     \nobreak
+     \hb@xt@\@pnumwidth{\hfil\normalcolor\normalsize {\bfseries #5}}%
+     \par}%
+  \endgroup
+  \fi}
+
+\def\@partdottedtocline#1#2#3#4#5{%
+  \begingroup
+  \def\numberline##1{\hbox to 24\p@{{##1\hss}}}
+  \renewcommand\@dotsep{1000}
+  \ifnum #1>\c@tocdepth \else
+    \vskip 11pt\goodbreak
+    {\leftskip #2\relax   \rightskip \@tocrmarg \parfillskip -\rightskip
+     \parindent #2\relax\@afterindenttrue
+     \interlinepenalty\@M
+     \leavevmode
+     \@tempdima #3\relax
+\advance\leftskip \@tempdima%%added
+     \null\nobreak\hskip -\leftskip
+     {\fontsize{9\p@}{13\p@}\selectfont\sansbold{\uppercase{#4}}}\nobreak
+     \leaders\hbox{$\m@th         \mkern \@dotsep mu\hbox{.}\mkern \@dotsep
+        mu$}\hfill
+     \nobreak
+     \hb@xt@\@pnumwidth{\hfil\normalcolor{}}%\fontsize{9\p@}{13\p@}\selectfont\sansbold#5
+     \par\vspace{2\p@}}%
+  \endgroup
+  \fi}
+
+\def\@figtabdottedtocline#1#2#3#4#5{%
+  \renewcommand\@dotsep{1000}%
+  \ifnum #1>\c@tocdepth \else%
+\def\numberline##1{\hb@xt@\@tempdima{{\fontsize{8.5}{13}\selectfont\sansbold{##1}}\hfil}}
+    \vskip \z@ %
+    {\leftskip #2\relax \rightskip \@tocrmarg \parfillskip -\rightskip%
+     \parindent #2\relax\@afterindenttrue%
+     \interlinepenalty\@M%
+     \leavevmode%
+     \@tempdima #3\relax%
+     \advance\leftskip \@tempdima \null\nobreak\hskip -\leftskip%
+\fontsize{9}{13}\selectfont%
+     {\fontsize{9}{13}\selectfont\sf#4}\nobreak%
+     \leaders\hbox{$\m@th \mkern \@dotsep mu\hbox{.}\mkern \@dotsep%
+        mu$}\hfill%
+     \nobreak%
+     \hb@xt@\@pnumwidth{\hfil\normalcolor\fontsize{9}{13}\selectfont\sf#5}%%
+     \par\vspace{3\p@}}%%
+  \fi}%
+
+\newcommand\@pnumwidth{1.5pc}
+\newcommand\@tocrmarg{2.55em plus 1fil}
+\newcommand\@dotsep{1}             %%% <-- very large value so we don't get any dots
+\newcommand\tableofcontents{%
+    \if@twocolumn
+      \@restonecoltrue\onecolumn
+    \else
+      \@restonecolfalse
+    \fi
+
+    \chapter*{Contents}
+\markboth{Contents}{Contents}
+    \chaptermark{Contents}       %% <-- check the running heads in all \chapter*
+    \@starttoc{toc}%                    %%      Code manually with \markboth{}{}
+    \if@restonecol\twocolumn\fi
+    }
+
+\newcommand\listoffigures{%
+    \if@twocolumn
+      \@restonecoltrue\onecolumn
+    \else
+      \@restonecolfalse
+    \fi
+    \chapter*{\listfigurename}%
+\addcontentsline{toc}{fmbm}{\listfigurename}
+      \@mkboth{\MakeUppercase\listfigurename}%
+              {\MakeUppercase\listfigurename}%
+    \@starttoc{lof}%
+    \if@restonecol\twocolumn\fi
+    }
+\newcommand*\l@figure{\@figtabdottedtocline{1}{\z@}{23.5\p@}}%
+\newcommand\listoftables{%
+    \if@twocolumn
+      \@restonecoltrue\onecolumn
+    \else
+      \@restonecolfalse
+    \fi
+    \chapter*{\listtablename}%
+\addcontentsline{toc}{fmbm}{\listtablename}
+      \@mkboth{%
+          \MakeUppercase\listtablename}%
+         {\MakeUppercase\listtablename}%
+    \@starttoc{lot}%
+    \if@restonecol\twocolumn\fi
+    }
+\let\l@table\l@figure
+
+\setcounter{tocdepth}{2}%
+
+\newcommand*\l@book[1]{{\vspace{\bigskipamount}\vspace{\medskipamount}\noindent{\large\bfseries #1}}}
+\newcommand*\l@part{\@partdottedtocline{0}{0em}{24pt}}
+\newcommand*\l@fmbm{\@fmbmdottedtocline{0}{24\p@}{0pt}}
+\newcommand*\l@chapter{\@chapterdottedtocline{1}{0pt}{24pt}}
+\newcommand*\l@section{\@dottedtocline{2}{24pt}{24pt}}
+\newcommand*\l@contributor{\@contributordottedtocline{2}{24pt}{24pt}}
+\newcommand*\l@subsection{\@dottedtocline{3}{48pt}{30pt}}
+\newcommand*\l@subsubsection{\@dottedtocline{4}{76.5pt}{35pt}}
+\newcommand*\l@paragraph{\@dottedtocline{5}{114pt}{40pt}}
+\newcommand*\l@subparagraph{\@dottedtocline{5}{154.5pt}{50pt}}
+\newcommand*\l@appendix{\@appendixdottedtocline{2}{0em}{17pt}}
+\newcommand*\l@appsection{\@dottedtocline{2}{17pt}{23pt}}
+\newcommand*\l@endmatter{\@chapterdottedtocline{2}{0em}{0em}}
+
+
+\flushbottom%
+\frenchspacing%
+\ps@headings%
+\onecolumn%
+\fnbelowfloat%
+
+\graphicspath{{g:/artwork/oup/Jork/}}
+
+\hyphenation{Figure Figures Table Tables Section Sections}
+
+% Reset eqnarray to avoid to avoid \arraycolsep between 
+% columns. Take from a post on comp.text.tex 
+% by Fred Bartlett <fbartlet@optonline.net> 
+\newif\if@alignpoint
+\def\eqnarray{%
+  \stepcounter{equation}%
+  \def\@currentlabel{\p@equation\theequation}%
+  \global\@eqnswtrue
+  \m@th
+  \global\@eqcnt\z@
+  \tabskip\@centering
+  \let\\\@eqncr
+  $$\everycr{}\halign to\displaywidth\bgroup
+    \hskip\@centering$\displaystyle\tabskip\z@skip{##}$\@eqnsel
+  &\global\@eqcnt\@ne\hfil\setbox\z@\hbox{$\displaystyle{{}##{}}$}%
+    \global\ifdim\wd\z@>\z@\@alignpointtrue\else\@alignpointfalse\fi
+    \box\z@\hfil
+  &\global\@eqcnt\tw@$\displaystyle{\if@alignpoint\else{}\fi##}$\hfil
+    \tabskip\@centering
+  &\global\@eqcnt\thr@@ \hb@xt@\z@\bgroup\hss##\egroup
+         \tabskip\z@skip
+  \cr}
+
+
+\def\th@definition{%
+  \thm@headsep 1em minus\p@\relax
+%%  \let\thm@indent\noindent % no indent
+\thm@headfont{\bfseries}% heading font is bold
+%%  \thm@notefont{}% same as heading font
+\thm@headpunct{}% no period after heading
+%%  \let\thm@swap\@gobble
+\thm@preskip\bigskipamount
+%%  \thm@postskip\theorempreskipamount
+  \itshape % body font
+}
+
+%%%Appendix%%
+\newenvironment{chapappendix}[1][\relax]{\bgroup%
+\vspace{11pt}%%%
+\noindent{\fontsize{10\p@}{13\p@}\selectfont\mathversion{bold}\raggedright\sansbold{#1}\par}%
+\let\section\appsection%
+\let\subsection\appsubsection%
+\let\subsubsection\appsubsubsection%
+\let\paragraph\appparagraph%
+\let\subparagraph\appsubparagraph%
+\renewcommand{\thechapter}{\Alph{chapter}}%
+\setcounter{chapter}{1}%
+\setcounter{section}{0}%
+\setcounter{subsection}{0}%
+\setcounter{subsubsection}{0}%
+%\fontsize{8}{10}\selectfont
+\footnotesize%
+}{\par\egroup}%
+
+\newcommand\appsection{\@startsection {section}{1}{\z@}%
+                                     {-11\p@}%
+                                     {11\p@}%
+{\fontsize{9\p@}{13\p@}\selectfont\mathversion{bold}\raggedright}}
+
+\newcommand\appsubsection{\@startsection{subsection}{2}{\z@}%
+                                     {-11\p@}%
+                                     {0.01\p@}%
+{\fontsize{9\p@}{13\p@}\selectfont\mathversion{bold}\raggedright}}
+
+\newcommand\appsubsubsection{\@startsection{subsubsection}{3}{\z@}%
+                                     {-11\p@}%
+                                     {-9\p@}%
+{\fontsize{9\p@}{13\p@}\selectfont\mathversion{bold}\raggedright}}
+
+\newcommand\appparagraph{\@startsection{paragraph}{4}{\z@}%
+                                     {-11\p@}%
+                                     {-9\p@}%
+{\fontsize{9\p@}{13\p@}\selectfont\raggedright}}
+
+\newcommand\appsubparagraph{\@startsection{subparagraph}{5}{\z@}%
+                                     {-11\p@}%
+                                     {-9\p@}%
+{\fontsize{9\p@}{13\p@}\selectfont\raggedright}}
+
+%%%Appendix%%
+\newcounter{appcounter}%
+\setcounter{appcounter}{0}
+%\refstepcounter{appcounter}%
+\renewcommand{\theappcounter}{\Alph{appcounter}}%
+
+\def\appendix{\par%
+\global\appendontrue%
+\let\@makechapterhead\@makeappchapterhead%
+\renewcommand{\chaptername}{Appendix}%
+  \renewcommand{\thechapter}{\Alph{chapter}}%
+        \setcounter{chapter}{0}%
+        \setcounter{section}{0}%
+        \setcounter{table}{0}%
+        \setcounter{figure}{0}%
+        \setcounter{equation}{0}%
+        \setcounter{subsection}{0}%
+\let\section\appsection%
+\let\subsection\appsubsection%
+\let\subsubsection\appsubsubsection%
+\let\paragraph\appparagraph%
+\let\subparagraph\appsubparagraph%
+%        \appendtrue
+\def\chaptername{Appendix}%
+\footnotesize%
+}
+
+
+\newtheoremstyle{common}
+    {9pt}% above space (default)
+    {9pt}% below space
+    {\small\itshape}% body
+    {0em}% indent
+    {\bfseries}% head
+    {}% punct
+    {9\p@}% space
+%    {}% custom
+{\thmname{\sansbold{#1}}\thmnumber{\@ifnotempty{\sansbold{#1}}{ }{\sansbold{#2}}}%
+ \thmnote{ {\sansbold{(#3)}}}}% theorem head
+\theoremstyle{common}
+
+\newtheoremstyle{boxcommon}
+    {8pt}% above space (default)
+    {8pt}% below space
+    {\footnotesize\itshape}% body
+    {0em}% indent
+    {\bfseries}% head
+    {}% punct
+    {9\p@}% space
+%    {}% custom
+{\thmname{\sansbold{#1}}\thmnumber{\@ifnotempty{\sansbold{#1}}{ }{\sansbold{#2}}}%
+ \thmnote{ {\sansbold{(#3)}}}}% theorem head
+
+
+%%%With Chapter Number
+\ifthmcountchapter
+\newtheorem{theorem}{Theorem}[chapter]%
+\newtheorem{corollary}{Corollary}[chapter]%
+\newtheorem{example}{Example}[chapter]%
+\newtheorem{lemma}{Lemma}[chapter]%
+\newtheorem{definition}{Definition}[chapter]%
+\newtheorem{proposition}{Proposition}[chapter]%
+\newtheorem{assumption}{Assumption}[chapter]%
+\newtheorem{remark}{Remark}[chapter]%
+\else
+\ifthmcountcont
+\newtheorem{theorem}{Theorem}%
+\newtheorem{corollary}[theorem]{Corollary}%
+\newtheorem{example}[theorem]{Example}%
+\newtheorem{lemma}[theorem]{Lemma}%
+\newtheorem{definition}[theorem]{Definition}%
+\newtheorem{proposition}[theorem]{Proposition}%
+\newtheorem{assumption}[theorem]{Assumption}%
+\newtheorem{remark}[theorem]{Remark}%
+\else
+\newtheorem{theorem}{Theorem}%
+\newtheorem{corollary}{Corollary}%
+\newtheorem{example}{Example}%
+\newtheorem{lemma}{Lemma}%
+\newtheorem{definition}{Definition}%
+\newtheorem{proposition}{Proposition}%
+\newtheorem{assumption}{Assumption}%
+\newtheorem{remark}{Remark}%
+\fi\fi
+
+%%%Proof%%
+\renewenvironment{proof}[1][\proofname]{\par%
+  \pushQED{\qed}%
+  \normalfont \topsep6\p@\relax%
+  \trivlist%
+\itemindent\z@  \item[\hskip\labelsep%
+        \itshape%
+    #1\@addpunct{.}\hspace{2.5\p@}]\ignorespaces%
+}{%
+  \popQED\endtrivlist\@endpefalse%
+}%
+
+\let\cal\mathcal
+
+\makeindex
+
+% Author queries
+\newcommand{\query}[2][0pt]{%
+  \marginpar{\vspace*{#1}%
+    \fbox{\parbox{6pc}{%
+     \raggedright\small
+        AQ: #2}}}}
+
+%%only for MIT
+\font\ldotsfnt=psyr scaled 1000%Donot change this, fixed as per client requirement
+\def\ldots{\,\hbox{\ldotsfnt\char188}\,\allowbreak}%
+
+\AtBeginDocument{%
+\thinmuskip=3mu%
+\medmuskip=3mu%
+\thickmuskip=3mu%
+}%
+
+\RequirePackage[bookmarks=true,bookmarksnumbered=true,bookmarksopenlevel=1,colorlinks=false,breaklinks,linkcolor=black,citecolor=black,urlcolor=black,hidelinks]{hyperref}%
+\ifxetex\relax\else\usepackage{breakurl}\fi%
+%\ifluatex\relax\else\usepackage{breakurl}\fi%
+\urlstyle{rm}%
+\def\url@acsstyle{%
+  \def\UrlSpecials{%
+    \do\/{\penalty\UrlBreakPenalty\mathchar`/}%
+    \do\~{\penalty\UrlBreakPenalty\mathchar`~}%
+    \do\.{\penalty\UrlBreakPenalty\mathchar`.}%
+    \do\,{\penalty\UrlBreakPenalty\mathchar`,}%
+    \do\-{\penalty\UrlBreakPenalty\mathchar`-}%
+    \do\_{\penalty\UrlBreakPenalty\mathchar`_}%
+    \do\?{\penalty\UrlBreakPenalty\mathchar`?}%
+    \do\#{\penalty\UrlBreakPenalty\mathchar"23}%
+    \do\%{\Url@percent}%
+    \do\={\penalty\UrlBreakPenalty\mathchar`=\penalty\UrlBreakPenalty}%
+    \do\&{\penalty\UrlBreakPenalty\mathchar`&\penalty\UrlBreakPenalty}%
+    \do\ {\Url@space}\do\^^M{\Url@space}%
+    \Url@force@Tilde}%
+}
+\urlstyle{acs}%
+
+\def\blankline{\vskip13pt\noindent\ignorespaces}
+
+\newcounter{exercise}
+\newcounter{subexercise}
+\newcounter{subsubexercise}
+
+\def\exercises{\section*{Exercises}\vspace{-12pt}\footnotesize%
+\addcontentsline{toc}{section}{\protect\numberline{}Exercises}%
+\setcounter{exercise}{0}%
+\parindent=2pc%
+\parskip=4pt%
+}
+
+\def\endexercises{}
+
+\long\def\exer#1{\vskip3pt\global\advance\c@exercise by 1
+\global\c@subexercise=0
+{\leftskip=1pc
+\noindent\hskip-1pc\hbox to 1pc{\bf \arabic{exercise}.\hfill}\ignorespaces#1
+\vskip1sp}
+}
+
+\long\def\subexer#1{\vskip3pt\global\advance\c@subexercise by 1
+\global\c@subsubexercise=0
+{\leftskip=27.5\p@%
+\noindent\hskip-15.5\p@\hbox to
+15.5\p@{\sansbold{(\alph{subexercise})}\hfill}\ignorespaces#1\vskip1sp}} 
+
+\long\def\subsubexer#1{\vskip3pt\global\advance\c@subsubexercise by 1
+{\leftskip=3pc
+\noindent\hskip-1pc\hbox to 1pc{\bf\roman{subsubexercise}.\hfill}\ignorespaces#1\vskip1sp}}
+
+\def\sidebysidesubexer#1#2{\vskip3pt\centerline{\hskip1pc\vtop{\global\advance\c@subexercise by 1
+\advance\hsize -14\p@ \hsize=.5\hsize
+\noindent\hbox to 14\p@{\sansbold{(\alph{subexercise})}\hfill}
+#1}\hfill\vtop{\global\advance\c@subexercise by 1 
+\advance\hsize -1pc \hsize=.5\hsize
+\noindent\hbox to 14\p@{\sansbold{(\alph{subexercise})}\hfill} #2}}}
+
+\def\sidebysidesubsubexer#1#2{\vskip3pt\centerline{\hskip27.5\p@\vtop{\global\advance\c@subsubexercise
+by 1\relax%
+\advance\hsize -27.5\p@ \hsize=.5\hsize
+\noindent\hbox to 15.5\p@{\sansbold{\roman{subsubexercise}.}\hfill}#1}\hfill\vtop{\global\advance\c@subsubexercise by 1
+\advance\hsize -27.5\p@ \hsize=.5\hsize
+ \noindent\hbox to 15.5\p@{\sansbold{\roman{subsubexercise}.}\hfill}#2}}}
+
+\def\endbookexercises{\chapter*{Exercises}%\addcontentsline{toc}{fmbm}{Exercises}%
+\footnotesize
+\vspace{-5\p@}%
+%\def\tabular{\blankline\footnotesize\savetabular}
+%\@namedef{tabular*}##1{\blankline\def\@halignto{to##1}
+%\footnotesize\@tabular}
+%\markright{Exercises}
+\setcounter{exercise}{0}
+\parindent=2pc
+\parskip=4pt
+}
+
+\def\endendbookexercises{}
+
+%%%%
+
+
+\usepackage{algorithm} %% 
+\usepackage{algorithmicx}
+\usepackage{algpseudocode}
+
+%% Glossary
+\def\glossary{\chapter*{Glossary}\addcontentsline{toc}{fmbm}{Glossary}\bgroup\footnotesize%
+\vspace{3\p@}%
+\parindent=0pt
+}
+\def\endglossary{\vskip1sp\egroup}
+
+\long\def\term#1#2{\noindent\hbox to
+.8in{\vtop{\raggedright\hsize=.7in\footnotesize%
+\sansbold{#1}}}\vtop{\footnotesize\advance\hsize-.8in
+#2}\vskip10pt}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%% Notation
+\def\notation{\vskip7pt\bgroup\parskip=0pt
+\noindent{\fontsize{9}{13}\selectfont\sansbold{Notation}}
+\vskip1pt
+\let\\=\cr
+\halign\bgroup##\hfill\hskip10pt\vrule depth 6pt width0pt height 10pt&##\hfill\\
+}
+\def\endnotation{\crcr\egroup\egroup\vskip8pt
+\global\everypar={\noindent\hskip-\parindent\global\everypar={}}}
+
+\def\dialogue{\vskip4pt}
+\def\enddialogue{\vskip7pt}
+\def\speaker#1{\vskip-\parskip\vskip3pt\noindent{\it #1}\hskip10pt\relax}
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\endinput

A különbségek nem kerülnek megjelenítésre, a fájl túl nagy
+ 124 - 13
all.bib


+ 374 - 0
bibsamp.bib

@@ -0,0 +1,374 @@
+@incollection{antibayes,
+Address = {Cambridge},
+Author = {G. Baggio and K. Stenning and M. van Lambalgen},
+Booktitle = {Cambridge {H}andbook of {F}ormal {S}emantics},
+Date-Added = {2014-02-06 15:25:25 +0100},
+Date-Modified = {2014-02-06 15:28:59 +0100},
+Editor = {M. Aloni and P. Dekker},
+Publisher = {Cambridge {U}niversity {P}ress},
+Title = {The {C}ognitive {I}nterface},
+Year = {Forthcoming}}
+
+@article{pijnacker2,
+Author = {J. Pijnacker and B. Geurts and M. van Lambalgen and J. Buitelaar and P. Hagoort},
+Date-Added = {2014-02-06 15:14:32 +0100},
+Date-Modified = {2014-02-06 15:17:39 +0100},
+Journal = {Journal of {C}ognitive {N}euroscience},
+Number = {2},
+Pages = {471--480},
+Title = {Reasoning with Exceptions: An Event-related Brain Potentials Study},
+Volume = {23},
+Year = {2010}}
+
+@article{baggio,
+Author = {R. Baggio and M. van Lambalgen and P. Hagoort},
+Date-Added = {2014-02-06 14:22:28 +0100},
+Date-Modified = {2014-02-06 14:24:02 +0100},
+Journal = {Journal of {M}emory and {L}anguage},
+Pages = {36--53},
+Title = {Computing and Recomputing Discourse Models: An {ERP} Study},
+Volume = {59},
+Year = {2008}}
+
+@inproceedings{kowalski_sadri,
+Author = {R. Kowalski and F. Sadri},
+Booktitle = {Web Reasoning and Rule Systems},
+Date-Added = {2014-02-05 15:43:59 +0100},
+Date-Modified = {2014-02-05 16:29:50 +0100},
+Editor = {Polleres, Axel and Swift, Terrance},
+Pages = {1--23},
+Publisher = {Springer Berlin Heidelberg},
+Series = {Lecture Notes in Computer Science},
+Title = {Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents},
+Volume = {5837},
+Year = {2009}}
+
+@book{anderson,
+Address = {Mahwah, NJ},
+Author = {J. R. Anderson},
+Date-Added = {2014-02-05 15:27:59 +0100},
+Date-Modified = {2014-02-05 16:10:22 +0100},
+Publisher = {Lawrence {E}rlbaum {A}ssociates},
+Title = {The Architecture of Cognition},
+Year = {1983}}
+
+@article{simul2,
+Author = {V. Gallese and A. Goldman},
+Date-Added = {2014-02-03 19:31:33 +0100},
+Date-Modified = {2014-02-03 19:32:35 +0100},
+Journal = {Trends in {C}ognitive {S}ciences},
+Number = {12},
+Pages = {493--501},
+Title = {Mirror Neurons and the Simulation Theory of Mind-Reading},
+Volume = {2},
+Year = {1998}}
+
+@article{simul,
+Author = {K. Zentgraf and J. Munzert and M. Bischoff and R.D. Newman-Norlund},
+Date-Added = {2014-02-03 19:25:43 +0100},
+Date-Modified = {2014-02-03 19:27:24 +0100},
+Journal = {Vision {R}esearch},
+Pages = {827--835},
+Title = {Simulation During Observation of Human Actions -- Theories, Empirical Studies, Applications},
+Volume = {51},
+Year = {2011}}
+
+@incollection{integrity_const,
+Author = {Godfrey, P. and Grant, J. and Gryz, J. and Minker, J.},
+Booktitle = {Logics for {D}atabases and {I}nformation {S}ystems},
+Date-Added = {2014-02-03 15:27:38 +0100},
+Date-Modified = {2014-02-08 11:53:32 +0100},
+Editor = {Chomicki, J. and Saake, G.},
+Pages = {265--306},
+Publisher = {Springer {US}},
+Series = {The {K}luwer {I}nternational {S}eries in {E}ngineering and {C}omputer {S}cience},
+Title = {Integrity Constraints: Semantics and Applications},
+Volume = {436},
+Year = {1998},}
+
+@inproceedings{reiterIC,
+Address = {{S}an {F}rancisco, {CA}, {USA}},
+Author = {Reiter, R.},
+Booktitle = {Proceedings of the 2nd conference on {T}heoretical {A}spects of {R}easoning about {K}nowledge, {TARK}'88},
+Date-Added = {2014-02-03 15:27:27 +0100},
+Date-Modified = {2014-02-05 17:29:27 +0100},
+Keywords = {integrity constraints, epistemic},
+Pages = {97--111},
+Publisher = {Morgan {K}aufmann {P}ublishers},
+Title = {{O}n {I}ntegrity {C}onstraints},
+Year = {1988}}
+
+@article{etzioni_cwr,
+Author = {Etzioni, O. and Golden, K. and Weld, D. S.},
+Date-Added = {2014-02-03 12:37:30 +0100},
+Date-Modified = {2014-02-03 23:49:41 +0100},
+Journal = {Artificial {I}ntelligence},
+Keywords = {closed world reasoning, planning algorithms},
+Number = {1--2},
+Pages = {113--148},
+Title = {Sound and Efficient Closed-World Reasoning for Planning},
+Volume = {89},
+Year = {1997}}
+
+@article{lifschitz2002,
+Author = {Lifschitz, V.},
+Date-Added = {2014-02-03 12:36:43 +0100},
+Date-Modified = {2014-02-03 12:36:43 +0100},
+Journal = {Artificial {I}ntelligence},
+Keywords = {planning, nonmonotonic reasoning},
+Month = {June},
+Number = {1--2},
+Pages = {39--54},
+Title = {Answer {S}et {P}rogramming and {P}lan {G}eneration},
+Volume = {138},
+Year = {2002}}
+
+@article{beller,
+Author = {S. Beller},
+Date-Added = {2014-01-31 16:47:38 +0100},
+Date-Modified = {2014-01-31 16:50:29 +0100},
+Journal = {Thinking \& Reasoning},
+Number = {4},
+Pages = {305--341},
+Title = {Deontic Norms, Deontic Reasoning, and Deontic Conditionals},
+Volume = {14},
+Year = {2008}}
+
+@article{paulus_kiraly,
+Author = {M. Paulus and I. Kir\'{a}ly},
+Date-Added = {2014-01-31 16:16:10 +0100},
+Date-Modified = {2014-01-31 16:17:44 +0100},
+Journal = {Journal of {E}xperimental {C}hild {P}sychology},
+Number = {2},
+Pages = {407--414},
+Title = {Early {R}ationality in {A}ction {P}erception and {P}roduction? {A} {T}heoretical {E}xposition},
+Volume = {116},
+Year = {2013}}
+
+@article{luo_baillargeon,
+Author = {Y. Luo and R. Baillargeon},
+Date-Added = {2014-01-31 16:08:03 +0100},
+Date-Modified = {2014-01-31 16:12:03 +0100},
+Journal = {Psychological {S}cience},
+Number = {8},
+Pages = {601--608},
+Title = {Can a Self-Propelled Box Have a Goal?: Psychological Reasoning in 5-Month-Old Infants},
+Volume = {16},
+Year = {2005}}
+
+@inproceedings{baker_tenenbaum_saxe06,
+Author = {C. L. Baker and J. Tenenbaum and R. Saxe},
+Booktitle = {Advances in Neural Information Processing Systems},
+Date-Added = {2014-01-30 12:16:28 +0100},
+Date-Modified = {2014-02-01 00:11:49 +0100},
+Publisher = {Cambridge, MA: MIT Press},
+Title = {Bayesian Models of Human Action Understanding},
+Volume = {18},
+Year = {2006}}
+
+@article{baker_saxe_tenenbaum09,
+Author = {C. L. Baker and J. Tenenbaum and R. Saxe},
+Date-Added = {2014-01-30 12:11:35 +0100},
+Date-Modified = {2014-02-05 23:44:19 +0100},
+Journal = {Cognition},
+Number = {3},
+Pages = {329--349},
+Title = {Action Understanding as Inverse Planning},
+Volume = {113},
+Year = {2009}}
+
+@article{lombrozo_carey,
+Author = {T. Lombrozo and S. Carey},
+Date-Added = {2014-01-30 11:55:36 +0100},
+Date-Modified = {2014-01-30 11:56:51 +0100},
+Journal = {Cognition},
+Number = {2},
+Pages = {167--204},
+Title = {Functional {E}xplanation and the {F}unction of {E}xplanation},
+Volume = {99},
+Year = {2006}}
+
+@article{csibra_gergely07,
+Author = {Csibra, G. and Gergely, G.},
+Date-Added = {2014-01-30 11:53:57 +0100},
+Date-Modified = {2014-01-31 11:19:59 +0100},
+Journal = {Acta {P}sychologica},
+Keywords = {teleological reasoning, inverse problem, prediction, means selection},
+Number = {1},
+Pages = {60--78},
+Title = {`{O}bsessed with Goals': Functions and Mechanisms of Teleological Interpretation of Actions in Humans},
+Volume = {124},
+Year = {2007}}
+
+@article{causality_infancy,
+Author = {Saxe, R. and Carey, S.},
+Date-Added = {2014-01-29 19:08:02 +0100},
+Date-Modified = {2014-01-31 11:20:20 +0100},
+Journal = {Acta {P}sychologica},
+Keywords = {Cause; Infancy; Empiricism; Rationalism; Innateness; Intervention},
+Number = {1-2},
+Pages = {144--165},
+Title = {The {P}erception of {C}ausality in {I}nfancy},
+Volume = {123},
+Year = {2006}}
+
+@inproceedings{mccarthy_hayes_philosAI,
+Author = {McCarthy, J. and Hayes, P.},
+Booktitle = {Machine {I}ntelligence},
+Date-Added = {2014-01-29 16:37:34 +0100},
+Date-Modified = {2014-02-01 00:55:14 +0100},
+Editor = {B. Meltzer and D. Michie},
+Pages = {463--502},
+Publisher = {Edinburgh {U}niversity {P}ress},
+Title = {Some Philosophical Problems from the Standpoint of Artificial Intelligence},
+Volume = {4},
+Year = {1969}}
+
+@book{kowalski2011,
+Address = {{N}ew {Y}ork},
+Author = {Kowalski, R.},
+Date-Added = {2014-01-29 16:36:59 +0100},
+Date-Modified = {2014-02-05 16:38:25 +0100},
+Keywords = {computational logic, proactive agents, reasoning},
+Publisher = {Cambridge {U}niversity {P}ress},
+Read = {0},
+Title = {Computational Logic and Human Thinking: How to be Artificially Intelligent},
+Year = {2011}}
+
+@book{mueller_commonsense,
+Address = {{S}an {F}rancisco, {CA}},
+Author = {Mueller, E.T.},
+Date-Added = {2014-01-29 16:11:31 +0100},
+Date-Modified = {2014-02-05 17:35:16 +0100},
+Publisher = {Morgan {K}aufmann {P}ublishers},
+Title = {Commonsense {R}easoning},
+Year = {2006}}
+
+@inproceedings{williams81,
+Address = {Cambridge},
+Author = {Williams, B.},
+Booktitle = {{M}oral {Lu}ck},
+Date-Added = {2014-01-29 15:45:40 +0100},
+Date-Modified = {2014-02-05 17:28:16 +0100},
+Editor = {Williams, B.},
+Pages = {101--113},
+Publisher = {Cambridge {U}niversity {P}ress},
+Title = {Internal and {E}xternal {R}easons},
+Year = {1981}}
+
+@article{braas,
+Author = {M. Brass and R. M. Schmitt and S. Spengler and G. Gergely},
+Date-Added = {2014-01-27 00:01:07 +0100},
+Date-Modified = {2014-01-31 11:20:30 +0100},
+Journal = {Current {B}iology},
+Number = {24},
+Pages = {2117--2121},
+Title = {Investigating Action Understanding: Inferential Processes versus Action Simulation},
+Volume = {17},
+Year = {2007}}
+
+@article{pollock97,
+Author = {J. Pollock},
+Date-Added = {2014-01-26 23:49:36 +0100},
+Date-Modified = {2014-01-31 11:18:59 +0100},
+Journal = {Nous},
+Number = {2},
+Pages = {143--169},
+Title = {Reasoning about {C}hange and {P}ersistence: {A} {S}olution to the {F}rame {P}roblem},
+Volume = {31},
+Year = {1997}}
+
+@book{pollock95,
+Address = {{MA}, {USA}},
+Author = {Pollock, J.L.},
+Date-Added = {2014-01-26 23:49:08 +0100},
+Date-Modified = {2014-02-05 17:30:05 +0100},
+Publisher = {{MIT} {P}ress {C}ambridge},
+Title = {Cognitive {C}arpentry: A {B}lueprint for {H}ow to {B}uild a {P}erson},
+Year = {1995}}
+
+@article{hickok,
+Author = {G. Hickok},
+Date-Added = {2014-01-26 23:46:54 +0100},
+Date-Modified = {2014-01-31 11:19:43 +0100},
+Journal = {Journal of Cognitive Neuroscience},
+Number = {7},
+Pages = {1229--1243},
+Title = {Eight Problems for the Mirror Neuron Theory of Action Understanding in Monkeys and Humans},
+Volume = {21},
+Year = {2009}}
+
+@article{nature2002,
+Author = {Gergely, G. and Bekkering, H. and Kir\'{a}ly, I.},
+Date-Added = {2014-01-26 23:43:16 +0100},
+Date-Modified = {2014-01-26 23:43:16 +0100},
+Journal = {Nature},
+Keywords = {rational, selective imitation},
+Pages = {755},
+Title = {Rational Imitation in Preverbal Infants},
+Volume = {415},
+Year = {2002}}
+
+@article{kiraly2013,
+Author = {Kir\'{a}ly, I. and Csibra, G. and Gergely, G.},
+Date-Added = {2014-01-26 23:41:16 +0100},
+Date-Modified = {2014-01-31 11:19:33 +0100},
+Journal = {Journal of {E}xperimental {C}hild {P}sychology},
+Number = {2},
+Pages = {471--486},
+Title = {Beyond Rational Imitation: Learning Arbitrary Means Actions from Communicative Demonstrations},
+Volume = {116},
+Year = {2013}}
+
+@book{PToE,
+Address = {Malden},
+Author = {van Lambalgen, M. and Hamm, F.},
+Date-Added = {2014-01-26 23:40:14 +0100},
+Date-Modified = {2014-02-01 01:57:52 +0100},
+Publisher = {Blackwell {P}ublishing},
+Title = {The {P}roper {T}reatment of {E}vents},
+Year = {2005}}
+
+@book{HRCS,
+Author = {Stenning, K. and van Lambalgen, M.},
+Date-Added = {2014-01-26 23:39:49 +0100},
+Date-Modified = {2014-01-26 23:39:49 +0100},
+Keywords = {closed world reasoning, neural networks, wason task},
+Publisher = {Bradford {B}ook, {T}he {MIT} {P}ress, {C}ambridge, {M}assachussets},
+Title = {Human {R}easoning and {C}ognitive {S}cience},
+Year = {2008}}
+
+@phdthesis{ada_doc,
+Author = {A. Varga},
+Date-Added = {2014-01-11 09:20:59 +0100},
+Date-Modified = {2014-01-11 09:24:15 +0100},
+School = {Department of Philosophy, Central European University, Budapest},
+Title = {A Formal Model of Infants' Acquisition of Practical Knowledge from Observation},
+Type = {Doctoral dissertation},
+Year = {2013}}
+
+@article{chater_vitany,
+Author = {N. Chater and P. Vitanyi},
+Date-Modified = {2014-01-31 11:20:09 +0100},
+Journal = {Trends in Cognitive Sciences},
+Number = {1},
+Pages = {19--22},
+Title = {Simplicity: A Unifying Principle in Cognitive Science?},
+Volume = 7,
+Year = 2003}
+
+@phdthesis{varga,
+Author = {A. Varga},
+Date-Modified = {2014-01-26 23:34:02 +0100},
+School = {Department of Philosophy, Central European University, Budapest},
+Title = {A Formal Model of Infants' Acquisition of Practical Knowledge from Observation},
+Type = {Doctoral dissertation},
+Year = {2013}}
+
+@book{schueler2005,
+Address = {New York, NY},
+Author = {G.F. Schueler},
+Date-Modified = {2014-02-05 17:34:27 +0100},
+Publisher = {Oxford University Press Inc.},
+Title = {Reasons and Purposes: Human Rationality and the Teleological Explanation of Action},
+Year = 2003}

+ 1335 - 0
book-MIT.bib

@@ -0,0 +1,1335 @@
+
+
+@book{Kernighan:1988nx,
+  address =       {Upper Saddle River, NJ, USA},
+  author =        {Brian W. Kernighan and Dennis M. Ritchie},
+  publisher =     {Prentice Hall Press},
+  title =         {The C programming language},
+  year =          {1988},
+  isbn =          {0-13-110362-8},
+}
+
+@book{Dybvig:1987aa,
+  address =       {Upper Saddle River, NJ, USA},
+  author =        {Dybvig, R. Kent},
+  publisher =     {Prentice-Hall, Inc.},
+  title =         {The SCHEME Programming Language},
+  year =          {1987},
+  isbn =          {0-13-791864-X},
+}
+
+@book{Abelson:1996uq,
+  address =       {Cambridge, MA, USA},
+  author =        {Abelson, Harold and Sussman, Gerald J.},
+  edition =       {2nd},
+  publisher =     {MIT Press},
+  title =         {Structure and Interpretation of Computer Programs},
+  year =          {1996},
+  isbn =          {0262011530},
+}
+
+@book{Friedman:1996aa,
+  address =       {Cambridge, MA, USA},
+  author =        {Friedman, Daniel P. and Felleisen, Matthias},
+  publisher =     {MIT Press},
+  title =         {The Little Schemer (4th Ed.)},
+  year =          {1996},
+  isbn =          {0-262-56099-2},
+}
+
+@book{Felleisen:2001aa,
+  address =       {Cambridge, MA, USA},
+  author =        {Felleisen, Matthias and Findler, Robert Bruce and
+                   Flatt, Matthew and Krishnamurthi, Shriram},
+  publisher =     {MIT Press},
+  title =         {How to Design Programs: An Introduction to
+                   Programming and Computing},
+  year =          {2001},
+  isbn =          {0-262-06218-6},
+}
+
+@book{Felleisen:2013aa,
+  address =       {San Francisco, CA, USA},
+  author =        {Felleisen, Matthias and Conrad, M.D. Barski and
+                   Horn, David Van and
+                   Eight Students of Northeastern University},
+  publisher =     {No Starch Press},
+  title =         {Realm of Racket: Learn to Program, One Game at a
+                   Time!},
+  year =          {2013},
+  isbn =          {1593274912, 9781593274917},
+}
+
+@techreport{Flatt:2014aa,
+  author =        {Matthew Flatt and Robert Bruce Findler and PLT},
+  institution =   {PLT Inc.},
+  number =        {6.0},
+  title =         {The Racket Guide},
+  year =          {2014},
+}
+
+@manual{Intel:2015aa,
+  author =        {Intel},
+  institution =   {Intel},
+  month =         {December},
+  title =         {Intel 64 and IA-32 Architectures Software Developer's
+                   Manual Combined Volumes: 1, 2A, 2B, 2C, 3A, 3B, 3C
+                   and 3D},
+  year =          {2015},
+}
+
+@book{Bryant:2010aa,
+  address =       {USA},
+  author =        {Bryant, Randal E. and O'Hallaron, David R.},
+  edition =       {2nd},
+  publisher =     {Addison-Wesley Publishing Company},
+  title =         {Computer Systems: A Programmer's Perspective},
+  year =          {2010},
+  isbn =          {0136108040, 9780136108047},
+}
+
+@manual{Bryant:2005aa,
+  author =        {Randal E. Bryant and David R. O'Hallaron},
+  month =         {September},
+  organization =  {Carnegie Mellon University},
+  title =         {x86-64 Machine-Level Programming},
+  year =          {2005},
+}
+
+@manual{Matz:2013aa,
+  author =        {Michael Matz and Jan Hubicka and Andreas Jaeger and
+                   Mark Mitchell},
+  month =         {October},
+  title =         {System V Application Binary Interface, AMD64
+                   Architecture Processor Supplement},
+  year =          {2013},
+}
+
+@misc{Microsoft:2018aa,
+  author =        {Microsoft},
+  howpublished =
+  {\url{https://docs.microsoft.com/en-us/windows-hardware/drivers/debugger/x64-architecture}},
+  month =         {March},
+  title =         {x64 Architecture},
+  year =          {2018},
+}
+
+@misc{Microsoft:2020aa,
+  author =        {Microsoft},
+  howpublished =
+  {\url{https://docs.microsoft.com/en-us/cpp/build/x64-calling-convention}},
+  month =         {July},
+  title =         {x64 calling convention},
+  year =          {2020},
+}
+
+@inproceedings{Dybvig:2006aa,
+  address =       {New York, NY, USA},
+  author =        {Dybvig, R. Kent},
+  booktitle =     {Proceedings of the Eleventh ACM SIGPLAN International
+                   Conference on Functional Programming},
+  pages =         {1--12},
+  publisher =     {ACM},
+  series =        {ICFP '06},
+  title =         {The Development of {Chez} {Scheme}},
+  year =          {2006},
+  doi =           {10.1145/1159803.1159805},
+  isbn =          {1-59593-309-3},
+  url =           {http://doi.acm.org/10.1145/1159803.1159805},
+}
+
+@inproceedings{Sarkar:2004fk,
+  author =        {Dipanwita Sarkar and Oscar Waddell and
+                   R. Kent Dybvig},
+  booktitle =     {ICFP '04: Proceedings of the ninth ACM SIGPLAN
+                   international conference on Functional programming},
+  pages =         {201--212},
+  publisher =     {ACM Press},
+  title =         {A nanopass infrastructure for compiler education},
+  year =          {2004},
+  isbn =          {1-58113-905-5},
+}
+
+@phdthesis{Keep:2012aa,
+  author =        {Andrew W. Keep},
+  month =         {December},
+  school =        {Indiana University},
+  title =         {A Nanopass Framework for Commercial Compiler
+                   Development},
+  year =          {2012},
+}
+
+@techreport{Dybvig:2010aa,
+  author =        {R. Kent Dybvig and Andrew Keep},
+  institution =   {Indiana University},
+  title =         {P523 Compiler Assignments},
+  year =          {2010},
+}
+
+@inproceedings{Ghuloum:2006bh,
+  author =        {Abdulaziz Ghuloum},
+  booktitle =     {Scheme and Functional Programming Workshop},
+  title =         {An Incremental Approach to Compiler Construction},
+  year =          {2006},
+}
+
+@book{Aho:1986qf,
+  address =       {Boston, MA, USA},
+  author =        {Alfred V. Aho and Ravi Sethi and Jeffrey D. Ullman},
+  publisher =     {Addison-Wesley Longman Publishing Co., Inc.},
+  title =         {Compilers: principles, techniques, and tools},
+  year =          {1986},
+  isbn =          {0-201-10088-6},
+}
+
+@article{Backus:1960aa,
+  address =       {New York, NY, USA},
+  author =        {Backus, J. W. and Bauer, F. L. and Green, J. and
+                   Katz, C. and McCarthy, J. and Perlis, A. J. and
+                   Rutishauser, H. and Samelson, K. and Vauquois, B. and
+                   Wegstein, J. H. and van Wijngaarden, A. and
+                   Woodger, M.},
+  editor =        {Naur, Peter},
+  journal =       {Commun. ACM},
+  month =         may,
+  number =        {5},
+  pages =         {299--314},
+  publisher =     {ACM},
+  title =         {Report on the Algorithmic Language ALGOL 60},
+  volume =        {3},
+  year =          {1960},
+  doi =           {10.1145/367236.367262},
+  issn =          {0001-0782},
+  url =           {http://doi.acm.org/10.1145/367236.367262},
+}
+
+@article{Knuth:1964aa,
+  address =       {New York, NY, USA},
+  author =        {Knuth, Donald E.},
+  journal =       {Commun. ACM},
+  month =         dec,
+  number =        {12},
+  pages =         {735--736},
+  publisher =     {ACM},
+  title =         {Backus Normal Form vs. Backus Naur Form},
+  volume =        {7},
+  year =          {1964},
+  doi =           {10.1145/355588.365140},
+  issn =          {0001-0782},
+  url =           {http://doi.acm.org/10.1145/355588.365140},
+}
+
+@article{SPERBER:2009aa,
+  author =        {Sperber, Michael and DYBVIG,R. KENT and FLATT,MATTHEW and
+                   VAN STRAATEN,ANTON and FINDLER,ROBBY and
+                   MATTHEWS,JACOB},
+  journal =       {Journal of Functional Programming},
+  month =         {8},
+  pages =         {1--301},
+  title =         {Revised$^6$ Report on the Algorithmic Language
+                   Scheme},
+  volume =        {19},
+  year =          {2009},
+  doi =           {10.1017/S0956796809990074},
+  issn =          {1469-7653},
+  url =           {http://journals.cambridge.org/article_S0956796809990074},
+}
+
+@techreport{plt-tr,
+  author =        {Matthew Flatt and PLT},
+  institution =   {PLT Inc.},
+  note =              {\url{http://docs.racket-lang.org/reference/index.html}},
+  title =         {The {R}acket Reference~6.0},
+  year =          {2014},
+}
+
+@inproceedings{reynolds72:_def_interp,
+  author =        {John C. Reynolds},
+  booktitle =     {{ACM} '72: Proceedings of the {ACM} Annual
+                   Conference},
+  pages =         {717--740},
+  publisher =     {{ACM} Press},
+  title =         {Definitional interpreters for higher-order
+                   programming languages},
+  year =          {1972},
+}
+
+@book{Jones:1993uq,
+  address =       {Upper Saddle River, NJ, USA},
+  author =        {Neil D. Jones and Carsten K. Gomard and
+                   Peter Sestoft},
+  publisher =     {Prentice-Hall, Inc.},
+  title =         {Partial evaluation and automatic program generation},
+  year =          {1993},
+  isbn =          {0-13-020249-5},
+}
+
+@techreport{Danvy:1991fk,
+  author =        {Olivier Danvy},
+  institution =   {Kansas State University},
+  month =         {December},
+  number =        {CIS-92-02},
+  title =         {Three Steps for the {CPS} Transformation},
+  year =          {1991},
+}
+
+@inproceedings{Flanagan:1993cg,
+  author =        {Cormac Flanagan and Amr Sabry and Bruce F. Duba and
+                   Matthias Felleisen},
+  booktitle =     {Conference on {P}rogramming {L}anguage {D}esign and
+                   {I}mplementation},
+  month =         {June},
+  pages =         {502--514},
+  series =        {PLDI},
+  title =         {The essence of compiling with continuations},
+  year =          {1993},
+}
+
+@book{Cooper:2011aa,
+  author =        {Keith Cooper and Linda Torczon},
+  edition =       {2nd},
+  publisher =     {Morgan Kaufmann},
+  title =         {Engineering a Compiler},
+  year =          {2011},
+}
+
+@book{Appel:2003fk,
+  author =        {Andrew W. Appel and Jens Palsberg},
+  publisher =     {Cambridge University Press},
+  title =         {Modern Compiler Implementation in Java},
+  year =          {2003},
+  isbn =          {052182060X},
+}
+
+@book{Balakrishnan:1996ve,
+  author =        {Balakrishnan, V. K.},
+  publisher =     {Dover Publications, Incorporated},
+  title =         {Introductory Discrete Mathematics},
+  year =          {1996},
+  isbn =          {0486691152},
+}
+
+@book{Rosen:2002bh,
+  author =        {Rosen, Kenneth H.},
+  publisher =     {McGraw-Hill Higher Education},
+  title =         {Discrete Mathematics and Its Applications},
+  year =          {2002},
+  isbn =          {0072474777},
+}
+
+@article{Brelaz:1979eu,
+  address =       {New York, NY, USA},
+  author =        {Br\'{e}laz, Daniel},
+  journal =       {Commun. ACM},
+  number =        {4},
+  pages =         {251--256},
+  publisher =     {ACM},
+  title =         {New methods to color the vertices of a graph},
+  volume =        {22},
+  year =          {1979},
+  issn =          {0001-0782},
+}
+
+@phdthesis{Gebremedhin:1999fk,
+  author =        {Assefaw Hadish Gebremedhin},
+  school =        {University of Bergen},
+  title =         {Parallel Graph Coloring},
+  year =          {1999},
+}
+
+@article{Omari:2006uq,
+  author =        {Hussein Al-Omari and Khair Eddin Sabri},
+  journal =       {Journal of Mathematics and Statistics},
+  number =        {4},
+  title =         {New Graph Coloring Algorithms},
+  volume =        {2},
+  year =          {2006},
+}
+
+@article{Horwitz:1966aa,
+  address =       {New York, NY, USA},
+  author =        {Horwitz, L. P. and Karp, R. M. and Miller, R. E. and
+                   Winograd, S.},
+  journal =       {J. ACM},
+  month =         jan,
+  number =        {1},
+  pages =         {43--61},
+  publisher =     {Association for Computing Machinery},
+  title =         {Index Register Allocation},
+  volume =        {13},
+  year =          {1966},
+  doi =           {10.1145/321312.321317},
+  issn =          {0004-5411},
+  url =           {https://doi.org/10.1145/321312.321317},
+}
+
+@inbook{Backus:1978aa,
+  address =       {New York, NY, USA},
+  author =        {Backus, John},
+  booktitle =     {History of Programming Languages},
+  pages =         {25--74},
+  publisher =     {Association for Computing Machinery},
+  title =         {The History of Fortran I, II, and III},
+  year =          {1978},
+  isbn =          {0127450408},
+  url =           {https://doi.org/10.1145/800025.1198345},
+}
+
+@article{Chaitin:1981vl,
+  author =        {Gregory J. Chaitin and Marc A. Auslander and
+                   Ashok K. Chandra and John Cocke and Martin E. Hopkins and
+                   Peter W. Markstein},
+  journal =       {Computer Languages},
+  pages =         {47-57},
+  title =         {Register allocation via coloring},
+  volume =        {6},
+  year =          {1981},
+}
+
+@article{Kempe:1879aa,
+  author =        {A. B. Kempe},
+  journal =       {American Journal of Mathematics},
+  number =        {3},
+  pages =         {193--200},
+  publisher =     {Johns Hopkins University Press},
+  title =         {On the Geographical Problem of the Four Colours},
+  volume =        {2},
+  year =          {1879},
+  issn =          {00029327, 10806377},
+  url =           {http://www.jstor.org/stable/2369235},
+}
+
+@inproceedings{Chaitin:1982vn,
+  author =        {G. J. Chaitin},
+  booktitle =     {SIGPLAN '82: Proceedings of the 1982 {SIGPLAN}
+                   Symposium on Compiler Construction},
+  pages =         {98--105},
+  publisher =     {ACM Press},
+  title =         {Register allocation \& spilling via graph coloring},
+  year =          {1982},
+  isbn =          {0-89791-074-5},
+}
+
+@article{Briggs:1994kx,
+  author =        {Preston Briggs and Keith D. Cooper and Linda Torczon},
+  journal =       {ACM Trans. Program. Lang. Syst.},
+  number =        {3},
+  pages =         {428--455},
+  publisher =     {ACM Press},
+  title =         {Improvements to graph coloring register allocation},
+  volume =        {16},
+  year =          {1994},
+  issn =          {0164-0925},
+}
+
+@article{George:1996aa,
+  address =       {New York, NY, USA},
+  author =        {George, Lal and Appel, Andrew W.},
+  journal =       {ACM Trans. Program. Lang. Syst.},
+  month =         may,
+  number =        {3},
+  pages =         {300--324},
+  publisher =     {Association for Computing Machinery},
+  title =         {Iterated Register Coalescing},
+  volume =        {18},
+  year =          {1996},
+  doi =           {10.1145/229542.229546},
+  issn =          {0164-0925},
+  url =           {https://doi.org/10.1145/229542.229546},
+}
+
+@incollection{Matula:1972aa,
+  author =        {David W. Matula and George Marble and
+                   Joel D. Isaacson},
+  booktitle =     {Graph Theory and Computing},
+  editor =        {RONALD C. READ},
+  pages =         {109 - 122},
+  publisher =     {Academic Press},
+  title =         {GRAPH COLORING ALGORITHMS††This research was
+                   supported in part by the Advanced Research Projects
+                   Agency of the Department of Defense under contract
+                   SD-302 and by the National Science Foundation under
+                   contract GJ-446.},
+  year =          {1972},
+  doi =           {https://doi.org/10.1016/B978-1-4832-3187-7.50015-5},
+  isbn =          {978-1-4832-3187-7},
+  url =           {http://www.sciencedirect.com/science/article/pii/
+                  B9781483231877500155},
+}
+
+@inproceedings{Chow:1984ys,
+  author =        {Frederick Chow and John Hennessy},
+  booktitle =     {SIGPLAN '84: Proceedings of the 1984 SIGPLAN
+                   symposium on Compiler construction},
+  pages =         {222--232},
+  publisher =     {ACM Press},
+  title =         {Register allocation by priority-based coloring},
+  year =          {1984},
+  isbn =          {0-89791-139-3},
+}
+
+@inproceedings{Cooper:1998ly,
+  author =        {Keith D. Cooper and L. Taylor Simpson},
+  booktitle =     {Compiler Construction},
+  title =         {Live range splitting in a graph coloring register
+                   allocator},
+  year =          {1998},
+}
+
+@inproceedings{Palsberg:2007si,
+  address =       {Darlinghurst, Australia, Australia},
+  author =        {Palsberg, Jens},
+  booktitle =     {CATS '07: Proceedings of the thirteenth Australasian
+                   symposium on Theory of computing},
+  pages =         {3--3},
+  publisher =     {Australian Computer Society, Inc.},
+  title =         {Register allocation via coloring of chordal graphs},
+  year =          {2007},
+  isbn =          {1-920-68246-5},
+}
+
+@article{Poletto:1999uq,
+  author =        {Massimiliano Poletto and Vivek Sarkar},
+  journal =       {ACM Trans. Program. Lang. Syst.},
+  number =        {5},
+  pages =         {895--913},
+  publisher =     {ACM Press},
+  title =         {Linear scan register allocation},
+  volume =        {21},
+  year =          {1999},
+  issn =          {0164-0925},
+}
+
+@inproceedings{Allen:1970uq,
+  author =        {Frances E. Allen},
+  booktitle =     {Proceedings of a symposium on Compiler optimization},
+  pages =         {1--19},
+  title =         {Control flow analysis},
+  year =          {1970},
+}
+
+@techreport{Friedman:1976aa,
+  author =        {Daniel P. Friedman and David S. Wise},
+  institution =   {Indiana University},
+  number =        {TR44},
+  title =         {Cons should not evaluate its arguments},
+  year =          {1976},
+}
+
+@book{Pierce:2002hj,
+  author =        {Benjamin C. Pierce},
+  publisher =     {MIT Press},
+  title =         {Types and {P}rogramming {L}anguages},
+  year =          {2002},
+}
+
+@article{Lieberman:1983aa,
+  address =       {New York, NY, USA},
+  author =        {Lieberman, Henry and Hewitt, Carl},
+  journal =       {Commun. ACM},
+  month =         jun,
+  number =        {6},
+  pages =         {419--429},
+  publisher =     {ACM},
+  title =         {A Real-time Garbage Collector Based on the Lifetimes
+                   of Objects},
+  volume =        {26},
+  year =          {1983},
+  doi =           {10.1145/358141.358147},
+  issn =          {0001-0782},
+  url =           {http://doi.acm.org/10.1145/358141.358147},
+}
+
+@inproceedings{Ungar:1984aa,
+  address =       {New York, NY, USA},
+  author =        {Ungar, David},
+  booktitle =     {Proceedings of the First ACM SIGSOFT/SIGPLAN Software
+                   Engineering Symposium on Practical Software
+                   Development Environments},
+  pages =         {157--167},
+  publisher =     {ACM},
+  series =        {SDE 1},
+  title =         {Generation Scavenging: A Non-disruptive High
+                   Performance Storage Reclamation Algorithm},
+  year =          {1984},
+  doi =           {10.1145/800020.808261},
+  isbn =          {0-89791-131-8},
+  url =           {http://doi.acm.org/10.1145/800020.808261},
+}
+
+@book{Jones:1996aa,
+  address =       {New York, NY, USA},
+  author =        {Jones, Richard and Lins, Rafael},
+  publisher =     {John Wiley \& Sons, Inc.},
+  title =         {Garbage Collection: Algorithms for Automatic Dynamic
+                   Memory Management},
+  year =          {1996},
+  isbn =          {0-471-94148-4},
+}
+
+@inproceedings{Detlefs:2004aa,
+  address =       {New York, NY, USA},
+  author =        {Detlefs, David and Flood, Christine and Heller, Steve and
+                   Printezis, Tony},
+  booktitle =     {Proceedings of the 4th International Symposium on
+                   Memory Management},
+  pages =         {37--48},
+  publisher =     {ACM},
+  series =        {ISMM '04},
+  title =         {Garbage-first Garbage Collection},
+  year =          {2004},
+  doi =           {10.1145/1029873.1029879},
+  isbn =          {1-58113-945-4},
+  url =           {http://doi.acm.org/10.1145/1029873.1029879},
+}
+
+@inproceedings{Tene:2011kx,
+  address =       {New York, NY, USA},
+  author =        {Tene, Gil and Iyengar, Balaji and Wolf, Michael},
+  booktitle =     {Proceedings of the international symposium on Memory
+                   management},
+  pages =         {79--88},
+  publisher =     {ACM},
+  series =        {ISMM '11},
+  title =         {C4: the continuously concurrent compacting collector},
+  year =          {2011},
+  doi =           {http://doi.acm.org/10.1145/1993478.1993491},
+}
+
+@incollection{Wilson:1992fk,
+  author =        {Wilson, Paul},
+  booktitle =     {Memory Management},
+  editor =        {Bekkers, Yves and Cohen, Jacques},
+  note =          {10.1007/BFb0017182},
+  pages =         {1-42},
+  publisher =     {Springer Berlin / Heidelberg},
+  series =        {Lecture Notes in Computer Science},
+  title =         {Uniprocessor garbage collection techniques},
+  volume =        {637},
+  year =          {1992},
+  url =           {http://dx.doi.org/10.1007/BFb0017182},
+}
+
+@article{Cheney:1970aa,
+  author =        {C. J. Cheney},
+  journal =       {Communications of the {ACM}},
+  number =        {11},
+  title =         {A Nonrecursive List Compacting Algoirthm},
+  volume =        {13},
+  year =          {1970},
+}
+
+@article{McCarthy:1960dz,
+  address =       {New York, NY, USA},
+  author =        {McCarthy, John},
+  journal =       {Commun. ACM},
+  number =        {4},
+  pages =         {184--195},
+  publisher =     {ACM},
+  title =         {Recursive functions of symbolic expressions and their
+                   computation by machine, Part I},
+  volume =        {3},
+  year =          {1960},
+  issn =          {0001-0782},
+}
+
+@article{Collins:1960aa,
+  address =       {New York, NY, USA},
+  author =        {Collins, George E.},
+  journal =       {Commun. ACM},
+  month =         dec,
+  number =        {12},
+  pages =         {655--657},
+  publisher =     {Association for Computing Machinery},
+  title =         {A Method for Overlapping and Erasure of Lists},
+  volume =        {3},
+  year =          {1960},
+  doi =           {10.1145/367487.367501},
+  issn =          {0001-0782},
+  url =           {https://doi.org/10.1145/367487.367501},
+}
+
+@inproceedings{Blackburn:2004aa,
+  address =       {New York, NY, USA},
+  author =        {Blackburn, Stephen M. and Cheng, Perry and
+                   McKinley, Kathryn S.},
+  booktitle =     {Proceedings of the Joint International Conference on
+                   Measurement and Modeling of Computer Systems},
+  pages =         {25--36},
+  publisher =     {ACM},
+  series =        {SIGMETRICS '04/Performance '04},
+  title =         {Myths and Realities: The Performance Impact of
+                   Garbage Collection},
+  year =          {2004},
+  doi =           {10.1145/1005686.1005693},
+  isbn =          {1-58113-873-3},
+  url =           {http://doi.acm.org/10.1145/1005686.1005693},
+}
+
+@book{Jones:2011aa,
+  author =        {Jones, Richard and Hosking, Antony and Moss, Eliot},
+  edition =       {1st},
+  publisher =     {Chapman \& Hall/CRC},
+  title =         {The Garbage Collection Handbook: The Art of Automatic
+                   Memory Management},
+  year =          {2011},
+  isbn =          {1420082795, 9781420082791},
+}
+
+@inproceedings{Shahriyar:2013aa,
+  author =        {Shahriyar, Rifat and Blackburn, Stephen M. and
+                   Yang, Xi and McKinley, Kathryn M.},
+  booktitle =     {OOPSLA '13: Proceeding of the 24th ACM SIGPLAN
+                   conference on Object oriented programming systems
+                   languages and applications},
+  month =         {oct},
+  title =         {Taking Off the Gloves with Reference Counting Immix},
+  year =          {2013},
+  doi =           {http://dx.doi.org/10.1145/2509136.2509527},
+}
+
+@inproceedings{Cutler:2015aa,
+  address =       {New York, NY, USA},
+  author =        {Cutler, Cody and Morris, Robert},
+  booktitle =     {Proceedings of the 2015 International Symposium on
+                   Memory Management},
+  pages =         {131--142},
+  publisher =     {ACM},
+  series =        {ISMM '15},
+  title =         {Reducing Pause Times with Clustered Collection},
+  year =          {2015},
+  doi =           {10.1145/2754169.2754184},
+  isbn =          {978-1-4503-3589-8},
+  url =           {http://doi.acm.org/10.1145/2754169.2754184},
+}
+
+@inproceedings{Shidal:2015aa,
+  address =       {New York, NY, USA},
+  author =        {Shidal, Jonathan and Spilo, Ari J. and
+                   Scheid, Paul T. and Cytron, Ron K. and
+                   Kavi, Krishna M.},
+  booktitle =     {Proceedings of the 2015 International Symposium on
+                   Memory Management},
+  pages =         {118--130},
+  publisher =     {ACM},
+  series =        {ISMM '15},
+  title =         {Recycling Trash in Cache},
+  year =          {2015},
+  doi =           {10.1145/2754169.2754183},
+  isbn =          {978-1-4503-3589-8},
+  url =           {http://doi.acm.org/10.1145/2754169.2754183},
+}
+
+@inproceedings{Osterlund:2016aa,
+  address =       {New York, NY, USA},
+  author =        {\"{O}sterlund, Erik and L\"{o}we, Welf},
+  booktitle =     {Proceedings of the 2016 ACM SIGPLAN International
+                   Symposium on Memory Management},
+  pages =         {1--12},
+  publisher =     {Association for Computing Machinery},
+  series =        {ISMM 2016},
+  title =         {Block-Free Concurrent GC: Stack Scanning and Copying},
+  year =          {2016},
+  doi =           {10.1145/2926697.2926701},
+  isbn =          {9781450343176},
+  url =           {https://doi.org/10.1145/2926697.2926701},
+}
+
+@inproceedings{Jacek:2019aa,
+  address =       {New York, NY, USA},
+  author =        {Jacek, Nicholas and Moss, J. Eliot B.},
+  booktitle =     {Proceedings of the 2019 ACM SIGPLAN International
+                   Symposium on Memory Management},
+  pages =         {53--63},
+  publisher =     {Association for Computing Machinery},
+  series =        {ISMM 2019},
+  title =         {Learning When to Garbage Collect with Random Forests},
+  year =          {2019},
+  doi =           {10.1145/3315573.3329983},
+  isbn =          {9781450367226},
+  url =           {https://doi.org/10.1145/3315573.3329983},
+}
+
+@inproceedings{Gamari:2020aa,
+  address =       {New York, NY, USA},
+  author =        {Gamari, Ben and Dietz, Laura},
+  booktitle =     {Proceedings of the 2020 ACM SIGPLAN International
+                   Symposium on Memory Management},
+  pages =         {87--99},
+  publisher =     {Association for Computing Machinery},
+  series =        {ISMM 2020},
+  title =         {Alligator Collector: A Latency-Optimized Garbage
+                   Collector for Functional Programming Languages},
+  year =          {2020},
+  doi =           {10.1145/3381898.3397214},
+  isbn =          {9781450375665},
+  url =           {https://doi.org/10.1145/3381898.3397214},
+}
+
+@inproceedings{Moore:1959aa,
+  author =        {E.F. Moore},
+  booktitle =     {Proceedings of an International Symposium on the
+                   Theory of Switching},
+  month =         {April},
+  title =         {The shortest path through a maze},
+  year =          {1959},
+}
+
+@book{Cormen:2001uq,
+  author =        {Thomas H. Cormen and Clifford Stein and
+                   Ronald L. Rivest and Charles E. Leiserson},
+  publisher =     {McGraw-Hill Higher Education},
+  title =         {Introduction to Algorithms},
+  year =          {2001},
+  isbn =          {0070131511},
+}
+
+@techreport{Steele:1977ab,
+  author =        {Steele, Jr., Guy L.},
+  institution =   {MIT Artificial Intelligence Lab},
+  month =         {September},
+  number =        {420},
+  type =          {AI Memo},
+  title =         {Data Representations in PDP-10 Maclisp},
+  year =          {1977},
+}
+
+@article{Appel:1989aa,
+  author =        {Appel, Andrew W.},
+  journal =       {LISP and Symbolic Computation},
+  number =        {2},
+  pages =         {153-162},
+  publisher =     {Kluwer Academic Publishers},
+  title =         {Runtime tags aren't necessary},
+  volume =        {2},
+  year =          {1989},
+  doi =           {10.1007/BF01811537},
+  issn =          {0892-4635},
+  language =      {English},
+  url =           {http://dx.doi.org/10.1007/BF01811537},
+}
+
+@inproceedings{Goldberg:1991aa,
+  address =       {New York, NY, USA},
+  author =        {Goldberg, Benjamin},
+  booktitle =     {Proceedings of the ACM SIGPLAN 1991 Conference on
+                   Programming Language Design and Implementation},
+  pages =         {165--176},
+  publisher =     {ACM},
+  series =        {PLDI '91},
+  title =         {Tag-free Garbage Collection for Strongly Typed
+                   Programming Languages},
+  year =          {1991},
+  doi =           {10.1145/113445.113460},
+  isbn =          {0-89791-428-7},
+  url =           {http://doi.acm.org/10.1145/113445.113460},
+}
+
+@inproceedings{Diwan:1992aa,
+  address =       {New York, NY, USA},
+  author =        {Diwan, Amer and Moss, Eliot and Hudson, Richard},
+  booktitle =     {Proceedings of the ACM SIGPLAN 1992 Conference on
+                   Programming Language Design and Implementation},
+  pages =         {273--282},
+  publisher =     {ACM},
+  series =        {PLDI '92},
+  title =         {Compiler Support for Garbage Collection in a
+                   Statically Typed Language},
+  year =          {1992},
+  doi =           {10.1145/143095.143140},
+  isbn =          {0-89791-475-9},
+  url =           {http://doi.acm.org/10.1145/143095.143140},
+}
+
+@inbook{Siebert:2001aa,
+  address =       {Berlin, Heidelberg},
+  author =        {Siebert, Fridtjof},
+  chapter =       {Constant-Time Root Scanning for Deterministic Garbage
+                   Collection},
+  editor =        {Wilhelm, Reinhard},
+  pages =         {304--318},
+  publisher =     {Springer Berlin Heidelberg},
+  title =         {Compiler Construction: 10th International Conference,
+                   CC 2001 Held as Part of the Joint European
+                   Conferences on Theory and Practice of Software, ETAPS
+                   2001 Genova, Italy, April 2--6, 2001 Proceedings},
+  year =          {2001},
+  doi =           {10.1007/3-540-45306-7_21},
+  isbn =          {978-3-540-45306-2},
+  url =           {http://dx.doi.org/10.1007/3-540-45306-7_21},
+}
+
+@inproceedings{Henderson:2002aa,
+  address =       {New York, NY, USA},
+  author =        {Henderson, Fergus},
+  booktitle =     {Proceedings of the 3rd International Symposium on
+                   Memory Management},
+  pages =         {150--156},
+  publisher =     {ACM},
+  series =        {ISMM '02},
+  title =         {Accurate Garbage Collection in an Uncooperative
+                   Environment},
+  year =          {2002},
+  doi =           {10.1145/512429.512449},
+  isbn =          {1-58113-539-4},
+  url =           {http://doi.acm.org/10.1145/512429.512449},
+}
+
+@article{Baker:2009aa,
+  address =       {Chichester, UK},
+  author =        {Baker, J. and Cunei, A. and Kalibera, T. and
+                   Pizlo, F. and Vitek, J.},
+  journal =       {Concurr. Comput. : Pract. Exper.},
+  month =         aug,
+  number =        {12},
+  pages =         {1572--1606},
+  publisher =     {John Wiley and Sons Ltd.},
+  title =         {Accurate Garbage Collection in Uncooperative
+                   Environments Revisited},
+  volume =        {21},
+  year =          {2009},
+  doi =           {10.1002/cpe.v21:12},
+  issn =          {1532-0626},
+  url =           {http://dx.doi.org/10.1002/cpe.v21:12},
+}
+
+@techreport{Dijkstra:1982aa,
+  author =        {E. W. Dijkstra},
+  institution =   {University of Texas at Austin},
+  number =        {EWD831},
+  title =         {Why numbering should start at zero},
+  year =          {1982},
+}
+
+@article{Kelsey:1998di,
+  author =        {R. Kelsey and W. Clinger and J. Rees (eds.)},
+  journal =       {Higher-Order and Symbolic Computation},
+  month =         {August},
+  number =        {1},
+  title =         {Revised$^5$ Report on the Algorithmic Language
+                   Scheme},
+  volume =        {11},
+  year =          {1998},
+}
+
+@techreport{Cardelli:1983aa,
+  author =        {Luca Cardelli},
+  institution =   {AT\&T Bell Laboratories},
+  number =        {TR-107},
+  title =         {The Functional Abstract Machine},
+  year =          {1983},
+}
+
+@inproceedings{Minamide:1996ys,
+  address =       {New York, NY, USA},
+  author =        {Minamide, Yasuhiko and Morrisett, Greg and
+                   Harper, Robert},
+  booktitle =     {Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium
+                   on Principles of programming languages},
+  pages =         {271--283},
+  publisher =     {ACM},
+  series =        {POPL '96},
+  title =         {Typed closure conversion},
+  year =          {1996},
+  doi =           {http://doi.acm.org/10.1145/237721.237791},
+  isbn =          {0-89791-769-3},
+  url =           {http://doi.acm.org/10.1145/237721.237791},
+}
+
+@inproceedings{Shivers:1988aa,
+  address =       {New York, NY, USA},
+  author =        {Shivers, O.},
+  booktitle =     {Proceedings of the ACM SIGPLAN 1988 Conference on
+                   Programming Language Design and Implementation},
+  pages =         {164--174},
+  publisher =     {ACM},
+  series =        {PLDI '88},
+  title =         {Control Flow Analysis in {Scheme}},
+  year =          {1988},
+}
+
+@inproceedings{Gilray:2016aa,
+  address =       {New York, NY, USA},
+  author =        {Gilray, Thomas and Lyde, Steven and Adams, Michael D. and
+                   Might, Matthew and Van Horn, David},
+  booktitle =     {Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT
+                   Symposium on Principles of Programming Languages},
+  pages =         {691--704},
+  publisher =     {Association for Computing Machinery},
+  series =        {POPL '16},
+  title =         {Pushdown Control-Flow Analysis for Free},
+  year =          {2016},
+  doi =           {10.1145/2837614.2837631},
+  isbn =          {9781450335492},
+  url =           {https://doi.org/10.1145/2837614.2837631},
+}
+
+@inproceedings{Keep:2012ab,
+  author =        {Keep, Andrew W. and Hearn, Alex and Dybvig, R. Kent},
+  booktitle =     {Proceedings of the 2012 Workshop on Scheme and
+                   Functional Programming},
+  series =        {Scheme '12},
+  title =         {Optimizing Closures in {O}(0)-time},
+  year =          {2012},
+}
+
+@article{Church:1932aa,
+  author =        {Church, Alonzo},
+  journal =       {Annals of Mathematics},
+  number =        {2},
+  pages =         {pp. 346-366},
+  publisher =     {Annals of Mathematics},
+  series =        {Second Series},
+  title =         {A Set of Postulates for the Foundation of Logic},
+  volume =        {33},
+  year =          {1932},
+  issn =          {0003486X},
+  language =      {English},
+  url =           {http://www.jstor.org/stable/1968337},
+}
+
+@techreport{Guy-L.-Steele:1978yq,
+  address =       {Cambridge, MA, USA},
+  author =        {Guy L. Steele},
+  publisher =     {Massachusetts Institute of Technology},
+  title =         {Rabbit: A Compiler for {Scheme}},
+  year =          {1978},
+}
+
+@inproceedings{Cardelli:1984aa,
+  author =        {Cardelli, Luca},
+  booktitle =     {ACM Symposium on LISP and Functional Programming},
+  pages =         {208--217},
+  publisher =     {ACM},
+  series =        {LFP '84},
+  title =         {Compiling a Functional Language},
+  year =          {1984},
+}
+
+@inproceedings{Gordon:1978aa,
+  address =       {New York, NY, USA},
+  author =        {Gordon, M. and Milner, R. and Morris, L. and
+                   Newey, M. and Wadsworth, C.},
+  booktitle =     {Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium
+                   on Principles of Programming Languages},
+  pages =         {119--130},
+  publisher =     {Association for Computing Machinery},
+  series =        {POPL '78},
+  title =         {A Metalanguage for Interactive Proof in LCF},
+  year =          {1978},
+  doi =           {10.1145/512760.512773},
+  isbn =          {9781450373487},
+  url =           {https://doi.org/10.1145/512760.512773},
+}
+
+@book{Milner:1990fk,
+  author =        {Robin Milner and Mads Tofte and Robert Harper},
+  publisher =     {MIT Press},
+  title =         {The definition of Standard ML},
+  year =          {1990},
+  isbn =          {0-262-63132-6},
+}
+
+@phdthesis{Dybvig:1987ab,
+  author =        {R. Kent Dybvig},
+  school =        {University of North Carolina at Chapel Hill},
+  title =         {Three Implementation Models for Scheme},
+  year =          {1987},
+}
+
+@article{Cardelli:1985kx,
+  address =       {New York, NY, USA},
+  author =        {Luca Cardelli and Peter Wegner},
+  journal =       {ACM Comput. Surv.},
+  number =        {4},
+  pages =         {471--523},
+  publisher =     {ACM Press},
+  title =         {On understanding types, data abstraction, and
+                   polymorphism},
+  volume =        {17},
+  year =          {1985},
+  issn =          {0360-0300},
+}
+
+@inproceedings{Kildall:1973vn,
+  author =        {Gary A. Kildall},
+  booktitle =     {POPL '73: Proceedings of the 1st annual ACM
+                   SIGACT-SIGPLAN symposium on Principles of programming
+                   languages},
+  pages =         {194--206},
+  publisher =     {ACM Press},
+  title =         {A unified approach to global program optimization},
+  year =          {1973},
+}
+
+@misc{Kleene:1952aa,
+  author =        {Kleene, S.},
+  publisher =     {Van Nostrand, New York},
+  title =         {{Introduction to Metamathematics}},
+  year =          {1952},
+  timestamp =     {2008-12-30T12:24:45.000+0100},
+}
+
+@inproceedings{Tobin-Hochstadt:2006fk,
+  author =        {Sam Tobin-Hochstadt and Matthias Felleisen},
+  booktitle =     {Dynamic Languages Symposium},
+  title =         {Interlanguage Migration: From Scripts to Programs},
+  year =          {2006},
+}
+
+@inproceedings{Matthews:2007zr,
+  author =        {Jacob Matthews and Robert Bruce Findler},
+  booktitle =     {The 34th ACM SIGPLAN-SIGACT Symposium on Principles
+                   of Programming Languages},
+  month =         {January},
+  title =         {Operational Semantics for Multi-Language Programs},
+  year =          {2007},
+}
+
+@inproceedings{Flanagan:2006mn,
+  address =       {Charleston, South Carolina},
+  author =        {Cormac Flanagan},
+  booktitle =     {{POPL} 2006: The 33rd {ACM SIGPLAN-SIGACT} Symposium
+                   on Principles of Programming Languages},
+  month =         {January},
+  pages =         {245-256},
+  title =         {Hybrid Type Checking},
+  year =          {2006},
+}
+
+@inproceedings{Gronski:2006uq,
+  author =        {Jessica Gronski and Kenneth Knowles and Aaron Tomb and
+                   Stephen N. Freund and Cormac Flanagan},
+  booktitle =     {Scheme and Functional Programming Workshop},
+  pages =         {93--104},
+  title =         {Sage: Hybrid Checking for Flexible Specifications},
+  year =          {2006},
+}
+
+@inproceedings{Anderson:2002kd,
+  author =        {Christopher Anderson and Sophia Drossopoulou},
+  booktitle =     {WOOD '03},
+  number =        {8},
+  publisher =     {Elsevier},
+  series =        {},
+  title =         {{BabyJ} - From Object Based to Class Based
+                   Programming via Types},
+  volume =        {82},
+  year =          {2003},
+}
+
+@inproceedings{Siek:2006bh,
+  author =        {Jeremy G. Siek and Walid Taha},
+  booktitle =     {Scheme and Functional Programming Workshop},
+  month =         {September},
+  pages =         {81-92},
+  title =         {Gradual typing for functional languages},
+  year =          {2006},
+}
+
+@inproceedings{Wadler:2009qv,
+  author =        {Philip Wadler and Robert Bruce Findler},
+  booktitle =     {European {S}ymposium on {P}rogramming},
+  month =         {March},
+  pages =         {1--16},
+  series =        {ESOP},
+  title =         {Well-typed programs can't be blamed},
+  year =          {2009},
+}
+
+@inproceedings{Herman:2006uq,
+  author =        {David Herman and Aaron Tomb and Cormac Flanagan},
+  booktitle =     {Trends in Functional Prog. (TFP)},
+  month =         {April},
+  pages =         {XXVIII},
+  title =         {Space-Efficient Gradual Typing},
+  year =          {2007},
+}
+
+@article{Herman:2010aa,
+  author =        {Herman, David and Tomb, Aaron and Flanagan, Cormac},
+  journal =       {Higher-Order and Symbolic Computation},
+  number =        {2},
+  pages =         {167-189},
+  publisher =     {Springer US},
+  title =         {Space-efficient gradual typing},
+  volume =        {23},
+  year =          {2010},
+  language =      {English},
+}
+
+@article{Henglein:1994nz,
+  author =        {Fritz Henglein},
+  journal =       {Science of Computer Programming},
+  month =         {June},
+  number =        {3},
+  pages =         {197-230},
+  title =         {Dynamic typing: syntax and proof theory},
+  volume =        {22},
+  year =          {1994},
+}
+
+@inproceedings{Siek:2015ab,
+  author =        {Jeremy G. Siek and Peter Thiemann and Philip Wadler},
+  booktitle =     {Conference on Programming Language Design and
+                   Implementation},
+  month =         {June},
+  series =        {PLDI},
+  title =         {Blame and coercion: Together again for the first
+                   time},
+  year =          {2015},
+}
+
+@inproceedings{Kuhlenschmidt:2019aa,
+  author =        {Andre Kuhlenschmidt and Deyaaeldeen Almahallawi and
+                   Jeremy G. Siek},
+  booktitle =     {Conference on Programming Language Design and
+                   Implementation},
+  month =         {June},
+  publisher =     {ACM},
+  series =        {PLDI},
+  title =         {Toward Efficient Gradual Typing for Structural Types
+                   via Coercions},
+  year =          {2019},
+}
+
+@inproceedings{stroustrup88:_param_types,
+  author =        {Bjarne Stroustrup},
+  booktitle =     {USENIX {C++} Conference},
+  month =         {October},
+  title =         {Parameterized Types for {C++}},
+  year =          {1988},
+}
+
+@inproceedings{Blelloch:1993aa,
+  address =       {New York, NY, USA},
+  author =        {Blelloch, Guy E. and Hardwick, Jonathan C. and
+                   Chatterjee, Siddhartha and Sipelstein, Jay and
+                   Zagha, Marco},
+  booktitle =     {Proceedings of the Fourth ACM SIGPLAN Symposium on
+                   Principles and Practice of Parallel Programming},
+  pages =         {102--111},
+  publisher =     {Association for Computing Machinery},
+  series =        {PPOPP '93},
+  title =         {Implementation of a Portable Nested Data-Parallel
+                   Language},
+  year =          {1993},
+  doi =           {10.1145/155332.155343},
+  isbn =          {0897915895},
+  url =           {https://doi.org/10.1145/155332.155343},
+}
+
+@inproceedings{Weeks:2006aa,
+  address =       {New York, NY, USA},
+  author =        {Weeks, Stephen},
+  booktitle =     {Proceedings of the 2006 Workshop on ML},
+  pages =         {1},
+  publisher =     {Association for Computing Machinery},
+  series =        {ML '06},
+  title =         {Whole-Program Compilation in MLton},
+  year =          {2006},
+  doi =           {10.1145/1159876.1159877},
+  isbn =          {1595934839},
+  url =           {https://doi.org/10.1145/1159876.1159877},
+}
+
+@techreport{liskov79:_clu_ref,
+  author =        {Barbara Liskov and Russ Atkinson and Toby Bloom and
+                   Eliot Moss and Craig Schaffert and Bob Scheifler and
+                   Alan Snyder},
+  institution =   {MIT},
+  month =         {October},
+  number =        {LCS-TR-225},
+  publisher =     {Massachusetts Institute of Technology},
+  title =         {{CLU} Reference Manual},
+  year =          {1979},
+}
+
+@inproceedings{Liskov:1993dk,
+  address =       {New York, NY, USA},
+  author =        {Liskov, Barbara},
+  booktitle =     {HOPL-II: The second ACM SIGPLAN conference on History
+                   of programming languages},
+  pages =         {133--147},
+  publisher =     {ACM},
+  title =         {A history of CLU},
+  year =          {1993},
+  isbn =          {0-89791-570-4},
+}
+
+@inbook{Appel:1987aa,
+  address =       {Berlin, Heidelberg},
+  author =        {Appel, Andrew W. and MacQueen, David B.},
+  booktitle =     {Functional Programming Languages and Computer
+                   Architecture: Portland, Oregon, USA, September
+                   14--16, 1987 Proceedings},
+  editor =        {Kahn, Gilles},
+  pages =         {301--324},
+  publisher =     {Springer Berlin Heidelberg},
+  title =         {A standard ML compiler},
+  year =          {1987},
+  doi =           {10.1007/3-540-18317-5_17},
+  isbn =          {978-3-540-47879-9},
+  url =           {http://dx.doi.org/10.1007/3-540-18317-5_17},
+}
+
+@inproceedings{Bracha:1998fk,
+  address =       {New York, NY, USA},
+  author =        {Bracha, Gilad and Odersky, Martin and
+                   Stoutamire, David and Wadler, Philip},
+  booktitle =     {Proceedings of the 13th ACM SIGPLAN conference on
+                   Object-oriented programming, systems, languages, and
+                   applications},
+  pages =         {183--200},
+  publisher =     {ACM},
+  series =        {OOPSLA '98},
+  title =         {Making the future safe for the past: adding
+                   genericity to the Java programming language},
+  year =          {1998},
+  doi =           {http://doi.acm.org/10.1145/286936.286957},
+  isbn =          {1-58113-005-8},
+  url =           {http://doi.acm.org/10.1145/286936.286957},
+}
+
+@inproceedings{Leroy:1992qb,
+  address =       {New York, NY, USA},
+  author =        {Xavier Leroy},
+  booktitle =     {POPL '92: Proceedings of the 19th ACM SIGPLAN-SIGACT
+                   symposium on Principles of programming languages},
+  pages =         {177--188},
+  publisher =     {ACM Press},
+  title =         {Unboxed objects and polymorphic typing},
+  year =          {1992},
+  isbn =          {0-89791-453-8},
+}
+
+@article{Morrison:1991aa,
+  address =       {New York, NY, USA},
+  author =        {Morrison, R. and Dearle, A. and Connor, R. C. H. and
+                   Brown, A. L.},
+  journal =       {ACM Trans. Program. Lang. Syst.},
+  month =         jul,
+  number =        {3},
+  pages =         {342--371},
+  publisher =     {ACM},
+  title =         {An Ad Hoc Approach to the Implementation of
+                   Polymorphism},
+  volume =        {13},
+  year =          {1991},
+  doi =           {10.1145/117009.117017},
+  issn =          {0164-0925},
+  url =           {http://doi.acm.org/10.1145/117009.117017},
+}
+
+@inproceedings{Harper:1995um,
+  author =        {Robert Harper and Greg Morrisett},
+  booktitle =     {POPL '95: Proceedings of the 22nd ACM SIGPLAN-SIGACT
+                   Symposium on Principles of Programming Languages},
+  pages =         {130--141},
+  publisher =     {ACM Press},
+  title =         {Compiling polymorphism using intensional type
+                   analysis},
+  year =          {1995},
+  isbn =          {0-89791-692-1},
+}
+

+ 1380 - 0
book-MIT.tex

@@ -0,0 +1,1380 @@
+%\documentclass[]{TimesAPriori_MIT}%%6x9
+\documentclass[7x10]{TimesAPriori_MIT}%%7x10
+%\documentclass[8x10]{TimesAPriori_MIT}%%8x10
+
+\usepackage[T1]{fontenc}
+\usepackage[utf8]{inputenc}
+
+%% For multiple indices:
+\usepackage{multind}
+\makeindex{subject}
+\makeindex{authors}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+%%% Any shortcut own defined macros place here
+%% sample of author macro:
+\def\taupav{\tau_{\mathrm{Pav}}}
+
+\newbox\oiintbox
+\setbox\oiintbox=\hbox{$\lower2pt\hbox{\huge$\displaystyle\circ$}
+\hskip-13pt\displaystyle\int\hskip-7pt\int_{S}\ $}
+\def\oiint{\copy\oiintbox}
+
+\def\boldnabla{\hbox{\boldmath$\displaystyle\nabla$}}
+
+%\usepackage{showframe}
+\def\ShowFrameLinethickness{0.125pt}
+
+\addbibresource{book-MIT.bib}
+\addbibresource{bibsamp.bib}
+
+\begin{document}
+
+\input{defs}
+
+\frontmatter
+
+\HalfTitle{Essentials of Compilation}
+
+
+\halftitlepage
+
+%% \begin{seriespage}
+%% \seriestitle{Industrial Economics}
+%% \serieseditor{Miriam Smith and Simon Rattle, editors}
+%% \title{Engineering and Economics}
+%% \author{Samuel Endgrove}
+%% \title{Structural Economics: From Beginning to End}
+%% \author{Guang Xi}
+%% \end{seriespage}
+
+\Title{Essentials of Compilation}
+
+\Booksubtitle{The Incremental, Nano-Pass Approach}
+
+\edition{Edition/Reprint Details goes here}
+
+\BookAuthor{Jeremy G. Siek}
+
+\imprint{The MIT Press\\
+Cambridge, Massachusetts\\
+London, England}
+
+\begin{copyrightpage}
+\textcopyright\ [YEAR] Massachusetts Institute of Technology
+
+All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher.
+
+This book was set in --------- by ---------. Printed and bound in the United States of America.
+
+Library of Congress Cataloging-in-Publication Data is available.
+
+ISBN:
+
+10\quad9\quad8\quad7\quad6\quad5\quad4\quad3\quad2\quad1
+\end{copyrightpage}
+
+\dedication{Dedication text goes here} 
+
+\begin{epigraphpage}
+\epigraph{First Epigraph line goes here}{Mention author name if any,
+\textit{Book Name if any}}
+
+\epigraph{Second Epigraph line goes here}{Mention author name if any}
+\end{epigraphpage}
+
+\tableofcontents
+
+\listoffigures
+
+\listoftables
+
+
+\chapter*{Preface}
+\addcontentsline{toc}{fmbm}{Preface}
+
+There is a magical moment when a programmer presses the ``run'' button
+and the software begins to execute. Somehow a program written in a
+high-level language is running on a computer that is only capable of
+shuffling bits. Here we reveal the wizardry that makes that moment
+possible. Beginning with the groundbreaking work of Backus and
+colleagues in the 1950s, computer scientists discovered techniques for
+constructing programs, called \emph{compilers}, that automatically
+translate high-level programs into machine code.
+
+We take you on a journey by constructing your own compiler for a small
+but powerful language. Along the way we explain the essential
+concepts, algorithms, and data structures that underlie compilers. We
+develop your understanding of how programs are mapped onto computer
+hardware, which is helpful when reasoning about properties at the
+junction between hardware and software such as execution time,
+software errors, and security vulnerabilities.  For those interested
+in pursuing compiler construction, our goal is to provide a
+stepping-stone to advanced topics such as just-in-time compilation,
+program analysis, and program optimization.  For those interested in
+designing and implementing programming languages, we connect
+language design choices to their impact on the compiler and the generated
+code.
+
+A compiler is typically organized as a sequence of stages that
+progressively translates a program to code that runs on hardware. We
+take this approach to the extreme by partitioning our compiler into a
+large number of \emph{nanopasses}, each of which performs a single
+task. This allows us to test the output of each pass in isolation, and
+furthermore, allows us to focus our attention making the compiler far
+easier to understand.
+
+%% [TODO: easier to understand/debug for those maintaining the compiler,
+%%   proving correctness]
+
+The most familiar approach to describing compilers is with one pass
+per chapter.  The problem with that is it obfuscates how language
+features motivate design choices in a compiler. We take an
+\emph{incremental} approach in which we build a complete compiler in
+each chapter, starting with arithmetic and variables and add new
+features in subsequent chapters.
+
+Our choice of language features is designed to elicit the fundamental
+concepts and algorithms used in compilers.
+\begin{itemize}
+\item We begin with integer arithmetic and local variables in
+  Chapters~\ref{ch:trees-recur} and \ref{ch:Rvar}, where we introduce
+  the fundamental tools of compiler construction: \emph{abstract
+    syntax trees} and \emph{recursive functions}. 
+\item In Chapter~\ref{ch:register-allocation-Rvar} we apply
+  \emph{graph coloring} to assign variables to machine registers.
+\item Chapter~\ref{ch:Rif} adds \code{if} expressions, which motivates
+  an elegant recursive algorithm for mapping expressions to
+  \emph{control-flow graphs}.
+\item Chapter~\ref{ch:Rvec} adds heap-allocated tuples, motivating
+  \emph{garbage collection}.
+\item Chapter~\ref{ch:Rfun} adds functions that are first-class values
+  but lack lexical scoping, similar to the C programming
+  language~\citep{Kernighan:1988nx} except that we generate efficient
+  tail calls. The reader learns about the procedure call stack,
+  \emph{calling conventions}, and their interaction with register
+  allocation and garbage collection.
+\item Chapter~\ref{ch:Rlam} adds anonymous functions with lexical
+  scoping, i.e., \emph{lambda abstraction}. The reader learns about
+  \emph{closure conversion}, in which lambdas are translated into a
+  combination of functions and tuples.
+\item Chapter~\ref{ch:Rdyn} adds \emph{dynamic typing}. Prior to this
+  point the input languages are statically typed.  The reader extends
+  the statically typed language with an \code{Any} type which serves
+  as a target for compiling the dynamically typed language.
+\item Chapter~\ref{ch:Rwhile} fleshes out support for imperative
+  programming languages with the addition of loops and mutable
+  variables. These additions elicit the need for \emph{dataflow
+    analysis} in the register allocator.
+\item Chapter~\ref{ch:Rgrad} uses the \code{Any} type of
+  Chapter~\ref{ch:Rdyn} to implement a \emph{gradually typed language}
+  in which different regions of a program may be static or dynamically
+  typed. The reader implements runtime support for \emph{proxies} that
+  allow values to safely move between regions.
+\item Chapter~\ref{ch:Rpoly} adds \emph{generics} with autoboxing,
+  leveraging the \code{Any} type and type casts developed in Chapters
+  \ref{ch:Rdyn} and \ref{ch:Rgrad}.
+\end{itemize}
+There are many language features that we do not include. Our choices
+weigh the incidental complexity of a feature against the fundamental
+concepts that it exposes. For example, we include tuples and not
+records because they both elicit the study of heap allocation and
+garbage collection but records come with more incidental complexity.
+
+Since 2016 this book has served as the textbook for the compiler
+course at Indiana University, a 16-week course for upper-level
+undergraduates and first-year graduate students.
+%
+Prior to this course, students learn to program in both imperative and
+functional languages, study data structures and algorithms, and take
+discrete mathematics.
+%
+At the beginning of the course, students form groups of 2-4 people.
+The groups complete one chapter every two weeks, starting with
+Chapter~\ref{ch:Rvar} and finishing with Chapter~\ref{ch:Rdyn}. Many
+chapters include a challenge problem that we assign to the graduate
+students. The last two weeks of the course involve a final project in
+which students design and implement a compiler extension of their
+choosing.  Chapters~\ref{ch:Rwhile}, \ref{ch:Rgrad}, and
+\ref{ch:Rpoly} can be used in support of these projects or they can
+replace some of the earlier chapters. For example, a course with an
+emphasis on statically-typed imperative languages would skip
+Chapter~\ref{ch:Rdyn} in favor of
+Chapter~\ref{ch:Rwhile}. Figure~\ref{fig:chapter-dependences} depicts
+the dependencies between chapters.
+
+This book has also been used in compiler courses at California
+Polytechnic State University, Rose–Hulman Institute of Technology, and
+University of Massachusetts Lowell.
+
+
+\begin{figure}[tp]
+\begin{tikzpicture}[baseline=(current  bounding  box.center)]
+  \node (C1) at (0,1.5) {\small Ch.~\ref{ch:trees-recur} Preliminaries};
+  \node (C2) at (4,1.5) {\small Ch.~\ref{ch:Rvar} Variables};
+  \node (C3) at (8,1.5) {\small Ch.~\ref{ch:register-allocation-Rvar} Registers};
+  \node (C4) at (0,0) {\small Ch.~\ref{ch:Rif} Control Flow};
+  \node (C5) at (4,0) {\small Ch.~\ref{ch:Rvec} Tuples};
+  \node (C6) at (8,0) {\small Ch.~\ref{ch:Rfun} Functions};
+  \node (C9) at (0,-1.5) {\small Ch.~\ref{ch:Rwhile} Loops};
+  \node (C8) at (4,-1.5) {\small Ch.~\ref{ch:Rdyn} Dynamic};
+  \node (C7) at (8,-1.5) {\small Ch.~\ref{ch:Rlam} Lambda};
+  \node (C10) at (4,-3) {\small Ch.~\ref{ch:Rgrad} Gradual};
+  \node (C11) at (8,-3) {\small Ch.~\ref{ch:Rpoly} Generics};
+
+  \path[->] (C1) edge [above] node {} (C2);
+  \path[->] (C2) edge [above] node {} (C3);
+  \path[->] (C3) edge [above] node {} (C4);
+  \path[->] (C4) edge [above] node {} (C5);
+  \path[->] (C5) edge [above] node {} (C6);
+  \path[->] (C6) edge [above] node {} (C7);
+  \path[->] (C4) edge [above] node {} (C8);
+  \path[->] (C4) edge [above] node {} (C9);
+  \path[->] (C8) edge [above] node {} (C10);
+  \path[->] (C10) edge [above] node {} (C11);
+\end{tikzpicture}
+  \caption{Diagram of chapter dependencies.}
+  \label{fig:chapter-dependences}
+\end{figure}
+
+We use the \href{https://racket-lang.org/}{Racket} language both for
+the implementation of the compiler and for the input language, so the
+reader should be proficient with Racket or Scheme. There are many
+excellent resources for learning Scheme and
+Racket~\citep{Dybvig:1987aa,Abelson:1996uq,Friedman:1996aa,Felleisen:2001aa,Felleisen:2013aa,Flatt:2014aa}. The
+support code for this book is in the \code{github} repository at the
+following URL:
+\begin{center}\small
+  \url{https://github.com/IUCompilerCourse/public-student-support-code}
+\end{center}
+
+The compiler targets x86 assembly language~\citep{Intel:2015aa}, so it
+is helpful but not necessary for the reader to have taken a computer
+systems course~\citep{Bryant:2010aa}. This book introduces the parts
+of x86-64 assembly language that are needed.
+%
+We follow the System V calling
+conventions~\citep{Bryant:2005aa,Matz:2013aa}, so the assembly code
+that we generate works with the runtime system (written in C) when it
+is compiled using the GNU C compiler (\code{gcc}) on Linux and MacOS
+operating systems.
+%
+On the Windows operating system, \code{gcc} uses the Microsoft x64
+calling convention~\citep{Microsoft:2018aa,Microsoft:2020aa}. So the
+assembly code that we generate does \emph{not} work with the runtime
+system on Windows. One workaround is to use a virtual machine with
+Linux as the guest operating system.
+
+\section*{Acknowledgments}
+
+The tradition of compiler construction at Indiana University goes back
+to research and courses on programming languages by Daniel Friedman in
+the 1970's and 1980's.  One of his students, Kent Dybvig, implemented
+Chez Scheme~\citep{Dybvig:2006aa}, a production-quality, efficient
+compiler for Scheme.  Throughout the 1990's and 2000's, Dybvig taught
+the compiler course and continued the development of Chez Scheme.
+%
+The compiler course evolved to incorporate novel pedagogical ideas
+while also including elements of efficient real-world compilers.  One
+of Friedman's ideas was to split the compiler into many small
+passes. Another idea, called ``the game'', was to test the code
+generated by each pass on interpreters.
+
+Dybvig, with help from his students Dipanwita Sarkar and Andrew Keep,
+developed infrastructure to support this approach and evolved the
+course to use even smaller
+nanopasses~\citep{Sarkar:2004fk,Keep:2012aa}.  Many of the compiler
+design decisions in this book are inspired by the assignment
+descriptions of \citet{Dybvig:2010aa}. In the mid 2000's a student of
+Dybvig's named Abdulaziz Ghuloum observed that the front-to-back
+organization of the course made it difficult for students to
+understand the rationale for the compiler design. Ghuloum proposed the
+incremental approach~\citep{Ghuloum:2006bh}.
+
+We thank the many graduate students who served as teaching assistants
+for the compiler course at IU. In particular, we thank Andre
+Kuhlenschmidt for his work on the garbage collector, Michael Vollmer
+for his work on efficient tail calls, and Michael Vitousek for his
+help running the first offering of the incremental compiler course at
+IU.
+
+We thank Bor-Yuh Chang, John Clements, Jay McCarthy, Joseph Near, Nate
+Nystrom, and Michael Wollowski for teaching courses based on early
+drafts of this book.
+
+We thank Ronald Garcia for being Jeremy's partner when they took the
+compiler course in the early 2000's and especially for finding the bug
+that sent the garbage collector on a wild goose chase!
+
+\mbox{}\\
+\noindent Jeremy G. Siek \\
+Bloomington, Indiana
+
+\mainmatter
+
+%% \part{Environmental Policy Analysis:\break Various Models for Material
+%% Flows\break in the Economy}
+
+
+%% %\begin{partintro}
+%% %\partintrotitle{This is an introduction to the part}
+%% %Policy analysis may be divided into a number of subspecialities\ldots
+%% %
+%% %\end{partintro}
+
+%% \chapterauthor{Contributor Name/Names goes here}
+
+%% \chapter[Environmental Policy Analysis with STREAM:\protect\\
+%% Equilibrium Model for Material Flows in the Economy]
+%% {Environmental Policy Analysis with STREAM: A Partial
+%% Equilibrium Model for Material Flows in the Economy}
+
+%% \chaptermark{Environmental Policy Analysis with STREAM}
+
+%% \vspace{-8pt}%
+%% \epigraph{What star falls unseen?}{William Faulkner}
+%% \epigraph{All seats provide equal viewing of the universe.}{Museum
+%% guide, Hayden Planetarium}
+
+%% \endchapepigraph
+
+%% \noindent
+%% Robotics has achieved its greatest success to date in the world of industrial manufacturing.
+%% Robot arms, or Manipulators, comprise a \$2 billion dollar industry.
+%% Bolted at its shoulder to a specific position in the assembly line, the robot arm
+%% can move with great speed and accuracy to perform repetitive tasks such as spot
+%% welding and painting.
+
+%% \section{Introduction}
+%% In the electronics industry, manipulators place
+%% surface-mounted components with superhuman precision, making the portable
+%% telephone and laptop computer possible.
+
+%% test citation \citet{antibayes} \citep{pijnacker2}
+
+%% \subsection{Test Subsection}
+%% Yet for all of their successes, these commercial robots suffer from a fundamental
+%% disadvantage: lack of mobility. 
+
+%% \subsubsection{Test subsubsection}
+%% A fixed manipulator has a limited range of motion
+%% that depends on where it is bolted down. In contrast, a mobile robot would be
+%% able to travel throughout the manufacturing plant, flexibly applying its talents
+%% wherever it is most effective. 
+
+
+%% \paragraph{\sansbold{Test paragraph}}
+%% For example, AGV (autonomous guided vehicle)
+%% robots autono\-mous\-ly deliver parts between various assembly stations
+%% by following special electrical guidewires using a custom sensor. The Helpmate
+%% service robot transports food and medication throughout hospitals by tracking
+%% the position of ceiling lights, which are manually specified to the robot
+%% beforehand.\endnote{Several companies have developed autonomous cleaning
+%% robots, mainly for large buildings. One such cleaning
+%% robot is in use
+%% at the Paris Metro. 
+%% }
+
+%% The Helpmate service robot transports food and medication throughout hospitals
+%% by tracking the position of ceiling lights, which are manually specified to
+%% the robot beforehand. Several companies have developed autonomous
+%% cleaning robots, mainly for large buildings. 
+
+%% This book focuses on the technology of mobility: how can a mobile robot move
+%% unsupervised through real-world environments to fulfill its tasks? The first
+%% challenge is locomotion itself. How should a mobile robot move, and what is it
+%% about a particular locomotion mechanism that makes it superior to alternative
+%% locomotion mechanisms?
+
+
+%% \subsection{Key Issues for Locomotion}
+%% Locomotion is the complement of manipulation. In manipulation, the robot arm
+%% is fixed but moves objects in the workspace by imparting force to them. In
+%% locomotion, the environment is fixed and the robot moves by imparting force to
+%% the environment. In both cases, the scientific basis is the study of actuators that
+%% generate interaction forces, and mechinisms that implement disired kinematic
+%% and dynamic properties. Locomotion and manipulation thus share the same core
+%% issues of stability, contact characteristics, and environmental type:
+
+%% \begin{itemize}
+%% \item
+%% stability
+%% \item
+%% number and geometry of contact points
+%% \begin{itemize}
+%% \item
+%% center of gravity
+%% \item
+%% static/dynamic stability
+%% \begin{itemize}
+%% \item
+%% inclination of terrain
+%% \item
+%% characteristics of contact
+%% \end{itemize}
+%% \item
+%% contact point/path size and shape
+%% \item
+%% angle of contact
+%% \end{itemize}
+%% \item
+%% friction
+%% \item
+%% type of environment
+%% \item
+%% structure
+%% medium (e.g. water, air. soft or hard ground).
+%% \end{itemize}
+%% For example, Plustech's walking robot provides automatic leg coordination while
+%% the human operator chooses an overall direction of travel. Figure
+%% 1.5 depicts an underwater vehicle that controls six propellers to autonomously
+%% transports food and medication throughout hospitals by tracking the position
+%% of ceiling lights, which are manually specified to the robot
+%% beforehand.  Several companies have developed autonomous robots.
+%% For example, Plustech's walking robot provides automatic leg coordination while
+%% the human operator chooses an overall direction of travel. Figure
+%% 1.5 depicts an underwater vehicle that controls six propellers to autonomously
+%% transports food and medication throughout hospitals by tracking the position
+%% of ceiling lights, which are manually specified to the robot
+%% beforehand. 
+
+
+%% \begin{figure}[t]
+%% %\centerline{\includegraphics[width=200pt]{figsamp}}
+%% \caption[Plustech developed the first application-driven walking robot. It is designed to move
+%% wood out of the forest. The leg coordination is automated, but navigation is still done
+%% by the human operator on the robot.
+%% {\tt http://www.plustech.fi/}]
+%% {Plustech developed the first application-driven walking robot. It is designed to move
+%% wood out of the forest. The leg coordination is automated, but navigation is still done
+%% by the human operator on the robot. {\tt http://www.plustech.fi/}}
+%% \end{figure}
+
+%% The six different events are
+%% \begin{enumerate}[2.]
+%% \item
+%% lift right leg
+%% \item
+%% left let leg
+%% \begin{enumerate}[ii.]
+%% \item
+%% release right leg
+%% \item
+%% release left leg
+%% \begin{enumerate}[(ii)]
+%% \item
+%% lift both legs together
+%% \item
+%% release both legs together
+%% \end{enumerate}
+%% \end{enumerate}
+%% \end{enumerate}
+%% Of course, this quickly grows quite large. For example, a robot with six legs
+%% has far more gaits theoretically.
+
+%% \section{Sample Equations}
+%% \begin{equation}
+%% \label{eq:rhoCHT}
+%% \rho^{\pi}= \frac{RI + \mathbb{E}_{\pi([L,\tau_L]|\textrm{post})}
+%% \left[C_L(\taupav+\tau_L) \right]   +
+%% \displaystyle{\int_{0}^{P}}{dw~ \mathbb{E}_{\pi_{w_L}}}
+%% \Biggl[\/\sum_{n_{L|[\textrm{pre},w]}}C_L(\tau_L)
+%% \Biggr]            }      {P +
+%% \mathbb{E}_{\pi([L,\tau_L] |\textrm{post})}[\tau_{L}] +\taupav +
+%% \displaystyle{ \int_{0}^{P}}{dw~ \mathbb{E}_{\pi_{w_L}}}   
+%% \Biggl[\sum_{n_{L|[\textrm{pre},w]}}\tau_L\Biggr]  
+%% }
+%% \end{equation}
+%% As long as
+%% $RI - K_LP > 
+%% \frac{1}{\beta}$
+%% \begin{equation}
+%% \left.\begin{array}{lrcl}
+%% &\rho^{\pi} &=&  \displaystyle\frac{\beta ( RI + K_L \taupav )-1} {\beta
+%% (P+\taupav )}    \\[12pt]
+%% \hbox{and}\hbox to .25in{\hfill}&\mathbb{E}[\tau_L | \text{post}]
+%% &=&\displaystyle \frac{P+\taupav}{\beta ( RI -
+%% K_LP)-1}  
+%% \label{eq:analytical_linear}
+%% \end{array}\right\}
+%% \end{equation} 
+
+
+%% \subsection{One Leg} 
+
+%% The minimum number of legs a legged robot can have is, of
+%% course, one. Minimizing the number of legs is beneficial for several reasons.
+%% Body mass is particularly important to walking machines, and the single leg
+%% minimizes cumulative leg mass.
+
+%% Omnidirectional locomotion with three spherical wheels The omnidirectional
+%% robot depicted in figure 2.23 is based on three spherical wheels, each actuated
+%% by one motor. In theis design, the sperical wheels are suspended by three contact
+%% points, two given by spherical bearings and one by a wheel connected to
+%% the motor axle. This concept provides excellent maneuverability and is simple
+%% in design. However, it is limited to flat surfaces and small loads, and it is quite
+%% difficult to find round wheels with high friction coefficients.
+
+
+%% \section{Natbib Citation Mark Up}
+%% Citations in the New Math book style are made using the Natbib
+%% commands. 
+
+%% \paragraph{\sansbold{Single citations}}
+%% may be made using the \verb+\citet+ or \verb+\citep+ command
+%% \text{argument}.
+
+%% \blankline
+
+%% \noindent\begin{tabular}{@{}ll}
+%% \sansbold{Type}&\sansbold{Results}\\
+%% \midrule
+%% \verb+\citet{jon90}+&Jones et al. (1990)\\
+%% \verb+\citet[chap. 2]{jon90}+&Jones et al. (1990, chap. 2)\\
+%%     \verb+\citep{jon90}+	    &   	(Jones et al., 1990)\\
+%%     \verb+\citep[chap. 2]{jon90}+ 	&    	(Jones et al., 1990, chap. 2)\\
+%%     \verb+\citep[see][]{jon90}+ 	 &    	(see Jones et al., 1990)\\
+%%     \verb+\citep[see][chap. 2]{jon90}+ 	&    	(see Jones et al., 1990, chap. 2)\\
+%%     \verb+\citet*{jon90}+ 	    &    	Jones, Baker, and Williams (1990)\\
+%%     \verb+\citep*{jon90}+	    &    	(Jones, Baker, and Williams,
+%%     1990) \\
+%% \end{tabular}
+
+
+%% \paragraph{\sansbold{Multiple citations}}
+%% may be made by including more than one citation
+%% key in the \verb+\citet+ or \verb+\citep+ command argument.
+
+%% \blankline
+
+%% \noindent\begin{tabular}{@{}ll}
+%% \sansbold{Type}&\sansbold{Results}\\
+%% \midrule
+%% \verb+\citet{jon90,jam91}+&Jones et al. (1990); James et al. (1991)\\
+%% \verb+\citep{jon90,jam91}+&(Jones et al., 1990; James et al. 1991)\\
+%% \verb+\citep{jon90,jon91}+&(Jones et al., 1990, 1991)\\
+%% \verb+\citep{jon90a,jon90b}+&(Jones et al., 1990a,b)\\
+%% \end{tabular}
+
+%% \blankline
+
+%% See \url{http://merkel.zoneo.net/Latex/natbib.php}
+%% for a reference sheet of natbib commands.
+
+%% \section{Sample Table Note}
+%% \begin{table}[h!]
+%% \begin{threeparttable}
+%% \caption[Time of the transition between Phase 1 and Phase 2]{Time of the transition between Phase 1 and Phase 2\tnote{$a$}
+%% \label{tab:label}}\tabfont
+%% \setlength{\tabcolsep}{45pt}%
+%% \begin{tabular}{@{}ll}
+%% \toprule
+%%  Run  & Time (min)  \\
+%% \midrule
+%%   $l1$  & 260   \\
+%%   $l2$  & 300   \\
+%%   $l3$  & 340   \\
+%%   $h1$  & 270   \\
+%%   $h2$  & 250   \\
+%%   $h3$  & 380   \\
+%%   $r1$  & 370   \\
+%%   $r2$  & 390   \\
+%% \bottomrule
+%% \end{tabular}
+%% \begin{tablenotes}[flushleft]\footnotesize
+%% \item[${a}$]Table note text here.
+%% \end{tablenotes}
+%% \end{threeparttable}
+%% \end{table}
+
+%% \chapter{Gravitational Waves}
+
+%% \section{Mass in Spacetime}
+%% As objects with
+%% mass move around in spacetime,\endnote{Test for endnote for endnote for endnote for endnote for endnote for endnote for endnote for endnote for endnote for endnote} the curvature changes to reflect the
+%% changed locations of those objects. In certain circumstances,
+%% accelerating objects generate changes in this curvature, which
+%% propagate outwards at the speed of light in a wave-like manner. These
+%% propagating phenomena are known as gravitational waves.\endnote{Prof. Gabriela Gonz\'alez, from Louisiana State University,
+%% said: ``We have discovered gravitational waves from the merger of black
+%% holes. It's been a very long road, but this is just the beginning.
+%% }
+
+%% \subsection{Gauss's Law for Gravity}
+%% In physics, \sfbfit{Gauss's law for gravity}, also known
+%% as \sfbfit{Gauss's flux
+%% theorem for}\break \sfbfit{gravity}, is a law of physics that is essentially
+%% equivalent to Newton's law of universal gravitation. It is named after
+%% Carl Friedrich Gauss.\index{authors}{Gauss, Carl Friedrich}
+
+%% The gravitational field \boldmath$g$\unboldmath (also called gravitational acceleration) is
+%% a vector field---a vector at each point of space (and time). It is
+%% defined so that the gravitational force experienced by a particle is
+%% equal to the mass of the particle multiplied by the gravitational
+%% field at that point.
+
+%% Gravitational flux is a surface integral of the gravitational field
+%% over a closed surface, analogous to how magnetic flux is a surface
+%% integral of the magnetic field.
+
+%% As a result of the divergence theorem, a host of physical laws can be
+%% written in both a differential form (where one quantity is the
+%% divergence of another) and an integral form (where the flux of one
+%% quantity through a closed surface is equal to another quantity).
+%% Three examples are Gauss's law (in electrostatics), Gauss's law for
+%% magnetism, and Gauss's law for gravity.     
+%% Gauss's law for gravity states:
+%% \begin{theorem}
+%%     The gravitational flux through any closed surface is proportional
+%%     to the enclosed mass.  \end{theorem}
+%% \begin{proof}
+%% The integral form of Gauss's law is:
+%% \[ \oiint
+%% \mathbf {E} \cdot \mathrm {d} \mathbf {A}  = 
+%% {\frac {Q}{\varepsilon _{0}}}  \]
+%% for any closed surface $S$ containing charge $Q$. By the divergence
+%% theorem, this equation is equivalent to:
+%% \[
+%% \iiint\limits_{V}
+%%  \boldnabla \cdot \mathbf{E} \,\, \mathrm{d}   V={\frac
+%% {Q}{\varepsilon _{0}}}
+%% \]
+%% for any volume $V$ containing charge $Q$. By the relation between charge
+%% and charge density, this equation is equivalent to:
+%% \[\iiint\limits_{V} \boldnabla \cdot\mathbf{E}\,\,\mathrm{d} V = 
+%% \iiint
+%% \limits _{V}{\frac {\rho }{\varepsilon _{0}}}\ \mathrm {d} V\]
+%% for any volume $V$. In order for this equation to be simultaneously
+%% true for every possible volume $V$,  
+%% it is necessary (and sufficient) for the integrands to be equal
+%% everywhere.  Therefore, this equation is equivalent to:
+%% \[    \boldnabla \cdot\mathbf{E} = \frac{\rho }{\varepsilon _{0}}. \]
+%% Thus the integral and differential forms are equivalent.
+%% \end{proof}
+
+
+%% \subsection{Gravitational Waves}
+
+%% Gravitational waves are `ripples' in the fabric of space-time caused
+%% by some of the most violent and energetic processes in the Universe.
+%% Albert Einstein predicted the existence of gravitational waves in 1916
+%% in his general theory of relativity. Einstein's mathematics showed
+%% that massive accelerating objects (such as neutron stars or black
+%% holes orbiting each other) would disrupt space-time in such a way that
+%% `waves' of distorted space would radiate from the source (like the
+%% movement of waves away from a stone thrown into a pond). Furthermore,
+%% these ripples would travel at the speed of light through the Universe,
+%% carrying with them information about their cataclysmic origins, as
+%% well as invaluable clues to the nature of gravity itself.
+
+%% %\begin{notation}
+%% %$g_{\mu\nu}(x^\lambda)=g_{\nu\mu}(x^\lambda)$&symmetric tensor\\
+%% %$g_{\mu\nu}\equiv\eta_{\mu\nu}=\mathrm{diag}(−1,1,1,1)$&Minkowski
+%% %spacetime\\
+%% %\end{notation}
+%% The strongest gravitational waves are produced by catastrophic events
+%% such as colliding black holes, the collapse of stellar cores
+%% (supernovae), coalescing neutron stars or white dwarf stars, the
+%% slightly wobbly rotation of neutron stars that are not perfect
+%% spheres, and the remnants of gravitational radiation created by the
+%% birth of the Universe itself.\endnote{``Gravitational waves go through everything. They are hardly affected
+%% by what they pass through, and that means that they are perfect
+%% messengers,'' said Prof Bernard Schutz, from Cardiff University, UK.
+%% \index{authors}{Schutz, Bernard}
+
+%% \begin{quote}
+%% The information carried on the gravitational wave is exactly the same
+%% as when the system sent it out; and that is unusual in astronomy. We
+%% can't see light from whole regions of our own galaxy because of the
+%% dust that is in the way, and we can't see the early part of the Big
+%% Bang because the Universe was opaque to light earlier than a certain
+%% time.
+
+%% With gravitational waves, we do expect eventually to see the Big Bang
+%% itself, he told the BBC.
+%% \end{quote}
+
+%% In addition, the study of gravitational waves may ultimately help
+%% scientists in their quest to solve some of the biggest problems in
+%% physics, such as the unification of forces, linking quantum theory
+%% with gravity.}
+
+%% \begin{extract}
+%% (Kostas D. Kokkotas, Article for the Encyclopedia of Physical Science
+%% and Technology, 3rd Edition, Volume 7, Academic Press, (2002))\\
+%% The distance $ds$ between two neighboring events, one with coordinates
+%% $x^\mu$ and the other with coordinates $x^\mu + \mathrm
+%% {dx}^\mu+ \mathrm{dx}^\mu$, can be expressed as a function of the coordinates via a
+%% symmetric tensor $g_{\mu\nu}(x^\lambda)=g_{\nu\mu}(x^\lambda)$, i.e.,
+%% %% \begin{equation}
+%% %% \mathrm{ds}^2=g_{\mu\nu}\,\mathrm{dx}^μ\,\mathrm{dx}^\nu
+%% %% \end{equation}
+%% This is a generalization of the standard measure of distance between two points in
+%% Euclidian space. For the Minkowski spacetime (the spacetime of special relativity),
+%% %$g_{\mu\nu}\equiv\eta_{\mu\nu}=\mathrm{diag}(−1,1,1,1)$.
+%% \end{extract}
+
+%% Though\index{authors}{Kokkotas, Kostas} gravitational waves were predicted to exist in 1916, actual
+%% proof of their existence wouldn't arrive until 1974, 20 years after
+%% Einstein's death.
+%% Since then, many astronomers have studied the timing of pulsar radio
+%% emissions and found similar effects, further confirming the existence
+%% of gravitational waves. But these confirmations had always come
+%% indirectly or mathematically and not through actual `physical'
+%% contact.
+
+%% That was the case up until September 14, 2015, when LIGO, for the
+%% first time, physically sensed distortions in spacetime itself caused
+%% by passing gravitational waves generated by two colliding black holes
+%% nearly 1.3 billion light years away! LIGO and its discovery will go
+%% down in history as one of the greatest human scientific achievements.
+
+%% \section*{A Dialogue}
+
+%% From the NY Times article of February 11, 2016,
+%% {\it Gravitational Waves Detected, Confirming Einstein's Theory}\/:
+
+%% \begin{dialogue}
+%% \speaker{Francis C\'ordova}
+%% It’s been decades, through a lot of different technological
+%% innovations,
+%% [and the foundation’s advisory board had] really scratched their heads on this one.
+
+%% \speaker{Janna Levin}I was freaking out!
+
+%% \speaker{Robert Garisto} [the editor of Physical Review Letters] 
+%% I got goose bumps while reading the LIGO paper.
+%% \end{dialogue}
+
+%% \noindent The discovery is a great triumph for three physicists---Kip Thorne of
+%% the California Institute of Technology, Rainer Weiss of the
+%% Massachusetts Institute of Technology and Ronald Drever, formerly of
+%% Caltech and now retired in Scotland---who bet their careers on the
+%% dream of measuring the most ineffable of Einstein’s notions.
+%% \index{authors}{C\'ordova, Francis}
+%% \index{authors}{Levin, Janna}
+%% \index{authors}{Garisto, Robert}
+%% \index{authors}{Thorne, Kip}
+%% \index{authors}{Weiss, Rainer}
+%% \index{authors}{Drever, Ronald}
+
+%% \begin{extract}
+%% Gravitational waves are not sound waves, and the
+%% general public easily could have been led to that conclusion. Sound
+%% waves travel only through a medium such as air; ripples in spacetime
+%% don’t need any medium to support them. Sound waves propagate at the
+%% speed of sound; gravitational waves move at the speed of light. Even
+%% someone with superhuman hearing could never listen in on a black hole
+%% collision.
+
+%% So why the connection between sound and gravitational waves? 
+%% \begin{itemize}
+%% \item LIGO detects gravitational waves with frequencies
+%% between several hertz and several kilohertz, the sweet spot for human
+%% hearing. 
+%% \item When two stellar-mass black holes collide, they happen to
+%% jiggle spacetime at the same frequency as that of pressure waves in
+%% the air that our ears pick up as sound.     
+%% \end{itemize}
+%% The LIGO discovery proves that black hole binaries exist, and that
+%% those binaries can merge within the age of the universe.
+%% \end{extract}
+
+%% While the origins of gravitational waves
+%% can be extremely violent, by the time the waves reach the Earth they
+%% are millions of times smaller and less disruptive. In fact, by the
+%% time gravitational waves from the first detection reached LIGO, the
+%% amount of space-time wobbling they generated was thousands of times
+%% smaller than the nucleus of an atom! Such inconceivably small
+%% measurements are what LIGO was designed to make.
+
+
+%% \begin{description}
+%% \item[Wave passes]
+%% As a gravitational wave passes an observer, that observer will find
+%% spacetime distorted by the effects of strain. 
+
+%% \item[Distances]
+%% Distances between
+%% objects increase and decrease rhythmically as the wave passes, at a
+%% frequency corresponding to that of the wave. 
+%% \end{description}
+%% This occurs despite such
+%% free objects never being subjected to an unbalanced force. The
+%% magnitude of this effect decreases proportional to the inverse
+%% distance from the source.
+
+%% Such systems cannot be observed with more
+%% traditional means such as optical telescopes or radio telescopes, and
+%% so gravitational-wave astronomy gives new insights into the working of
+%% the Universe. In particular, gravitational waves could be of interest
+%% to cosmologists as they offer a possible way of observing the very
+%% early Universe. This is not possible with conventional astronomy,
+%% since before recombination the Universe was opaque to electromagnetic
+%% radiation.
+
+%% Precise measurements of gravitational waves will also
+%% allow scientists to more thoroughly test the general theory of
+%% relativity.
+
+%% \begin{boxedtext}{Frank Wilczek on Einstein and Gravitation}
+%% Einstein's general relativity, as a theory of gravitation, is so tight
+%% conceptually that it allows only two free parameters: Newton’s
+%% constant and the cosmological term. It has passed every test that
+%% physicists and astronomers have devised. Yet there are reasons to
+%% remain dissatisfied.
+
+%% \section{First}
+%% First, the strength of gravity is grossly disproportionate to the
+%% strength of other forces. If we believe in the unity of nature’s
+%% operating system, how can that be? 
+
+%% \subsection{Second}
+%% Second, the measured value of the
+%% mass density of space devoid of matter---the cosmological term, often
+%% called dark energy---is incommensurate with reasonable expectations. Why
+%% is it much smaller than theory suggests, yet not zero? 
+
+%% \subsubsection{Third}
+%% Third, the
+%% equations that follow from straightforward quantization of general
+%% relativity break down in extreme conditions. What are the
+%% consequences? Those issues are important agenda items for the next 100
+%% years of physics. In the boxes, I've indicated a promising way to
+%% approach the question of the weakness of gravity. Here I'll offer a
+%% few comments on the other issues.
+
+
+%% \begin{extract}
+%% Theorists have estimated several contributions to the cosmological
+%% term-positive and negative---whose individual absolute values far exceed
+%% the observed total value. Thus the term’s observed smallness indicates
+%% delicate cancellations that our core theories do not explain. Perhaps,
+%% as suggested by Steven Weinberg, the explanation is anthropic. Too
+%% large a cosmological term would lead the universe to expand so rapidly
+%% that formation of structure in the universe would be inhibited.
+%% Neither galaxies nor stars nor planets would form, and thus observers
+%% could not emerge. Is that anthropic argument the best physics can
+%% do---is resistance futile? Or is some deeper principle at work?
+%% \end{extract}
+
+%% \section*{Conceptual difficulty}
+%% The conceptual difficulty of reconciling our theory of gravity,
+%% general relativity, with the principles of quantum mechanics has been
+%% the subject of much hyperbole. I think it is important, therefore,
+%% first to bring it down to earth.   
+
+%% (Frank Wilczek, Physics Today, April 2016,
+%% \url{scitation.aip.org/content/aip/magazine/physicstoday/article/69/4/10.1063/PT.3.3137})
+%% \end{boxedtext}
+%% \index{authors}{Wilczek, Frank}
+
+%% In principle, gravitational waves could exist at any frequency.
+%% However, very low frequency waves would be impossible to detect and
+%% there is no credible source for detectable waves of very high
+%% frequency. Stephen Hawking and Werner Israel list different frequency
+%% bands for gravitational waves that could plausibly be detected,
+%% ranging from 10--7 Hz up to 1011 Hz. 
+
+%% In theory, the loss of energy through gravitational radiation could
+%% eventually drop the Earth into the Sun. However, the total energy of
+%% the Earth orbiting the Sun (kinetic energy + gravitational potential
+%% energy) is about 1.14$\times$1036 joules of which only 200 joules per second
+%% is lost through gravitational radiation, leading to a decay in the
+%% orbit by about $1\times10$--15 meters per day or roughly the diameter of a
+%% proton. At this rate, it would take the Earth approximately $1\times 1013$
+%% times more than the current age of the Universe to spiral onto the
+%% Sun. This estimate overlooks the decrease in r over time, but the
+%% majority of the time the bodies are far apart and only radiating
+%% slowly, so the difference is unimportant in this example.
+
+%% \begin{table}
+%% \caption{A table of acceleration equations.}\tabfont
+%% \begin{tabular}{@{}l|l}    
+%% \toprule
+%% \it With initial velocity&\it Starting from rest\\
+%% \midrule
+%% $v_f=v_i+ a \Delta\, t$&$v_f=a\Delta\, t$\\
+%% $\Delta\, d=v_i \Delta\, t + 1/2 a \Delta\, t^2$&
+%% $\Delta\, d= 1/2 a \Delta\, t^2$\\
+%% $v_f=\sqrt{v_i^2+2a\Delta\, d}$&
+%% $v_f=\sqrt{2a\Delta\, d}$\\
+%% \bottomrule
+%% \end{tabular}
+%% \end{table}
+
+%% More generally, the rate of orbital decay can be approximated by [32].
+%% \[
+%%     \frac{\mathrm{d}r}{\mathrm{d}t} = - \frac{64}{5}\,
+%%     \frac{G^3}{c^5}\, \frac{(m_1m_2)(m_1+m_2)}{r^3}\ ,  
+%% \]
+%% where $r$ is the separation between the bodies, $t$ time, G Newton's
+%% constant, $c$ the speed of light, and $m1$ and $m2$ the masses of the
+%% bodies. This leads to an expected time to merger of 
+%% \begin{equation}
+%%     t= \frac{5}{256}\, \frac{c^5}{G^3}\,
+%%     \frac{r^4}{(m_1m_2)(m_1+m_2)}.  
+%% \end{equation}
+%% For example a pair of solar mass neutron stars in a circular orbit at
+%% a separation of $1.89\times108$ $m$ (189,000 km) has an orbital
+%% period of 1,000 
+
+
+%% \begin{boxedtext}{Two Theorems and a Corollary}
+ 	
+%% \begin{theorem}[Birkhoff's Theorem]
+%% The metric of the Schwarzschild black hole is the unique spherically
+%% symmetric solution of the vacuum {\it Einstein field equations}.
+%% \[G^{\mu\nu}=0.\]
+
+%% Stated another way, a spherically symmetric gravitational field in
+%% empty space must be static, with a metric given by the Schwarzschild
+%% black hole\index{authors}{Swarzchild, Karl}
+%% \index{authors}{Birkhoff, George David}
+%%  metric.
+%% \end{theorem}
+
+%% \begin{corollary}
+%% A corollary states that the metric inside a spherical cavity inside a
+%% spherical mass distribution is the Minkowski metric. 
+%% \end{corollary}
+
+%% \begin{theorem}[Schwarzschild Black Hole]
+%%  A black hole with zero charge $Q = 0$ and no angular momentum $J = 0$.
+%% The exterior solution for such a black hole is known as the
+%% Schwarzschild solution (or Schwarzschild metric), and is an exact
+%% unique solution to the Einstein field equations of general relativity
+%% for the general static isotropic metric (i.e., the most general metric
+%% tensor that can represent a static isotropic gravitational field), 
+%% \[
+%% d\tau^2=B(r)dt^2 - A(r)dr^2-r^2 \sin^2\theta\, d\phi^2.
+%% \]
+%% \end{theorem}
+
+%% \vspace{-6pt}
+
+%% \noindent
+%% In 1915, when Einstein first proposed them, the 
+%% Einstein field equations appeared so complicated that he did not 
+%% believe that a solution would ever be found. 
+%% He was therefore quite surprised when, only a year later, 
+%% Karl Schwarzschild  (1916) discovered one by making the assumption of
+%% spherical symmetry. 
+%% \end{boxedtext}
+
+
+
+%% \section{Samples of Programming Code}
+
+%% \begin{verbatim}
+%% procedure bubbleSort( A : list of sortable items )
+%%     n = length(A)
+%%     repeat
+%%        newn = 0
+%%        for i = 1 to n-1 inclusive do
+%%           if A[i-1] > A[i] then
+%%              swap(A[i-1], A[i])
+%%              newn = i
+%%           end if
+%%        end for
+%%        n = newn
+%%     until n = 0
+%% end procedure
+%% \end{verbatim}
+
+%% \newpage
+
+%% \noindent
+%% Algorithm environment:
+
+
+%% %% \begin{algorithm} takes option [p][b][t][h],  or some combination, like \begin{figure}
+%% \begin{algorithm}[h]
+%% \caption{A sample in an algorithm environment.}
+%% \begin{algorithmic}
+%% \If {$i\geq maxval$}
+%%     \State $i\gets 0$
+%% \Else
+%%     \If {$i+k\leq maxval$}
+%%         \State $i\gets i+k$
+%%     \EndIf
+%% \EndIf
+%% \end{algorithmic}
+%% \end{algorithm}
+
+%% \begin{boxedtext}{Two Examples  of Programming Code}
+
+%% \vspace{-1\topsep}
+
+%% \begin{verbatim}
+%% procedure bubbleSort( A : list of sortable items )
+%%     n = length(A)
+%%     repeat
+%% \end{verbatim}
+%% \end{boxedtext}
+
+%% \begin{exercises}
+%% \exer{For Hooker's data, Exercise 1.2, use the Box and Cox and Atkinson procedures to determine a appropriate transformation of PRES
+%% in the regression of PRES on TEMP. find $\hat\lambda$, $\tilde\lambda$,
+%% the score test, and the added variable plot for the score. 
+%% Summarize the results.}
+
+%% \subexer{The following data were collected in a study of the effect of dissolved sulfur
+%% on the surface tension of liquid copper (Baes and Killogg, 1953).}
+
+%% \medskip
+
+%% \hspace{3.5pt}\begin{tabular}{r@{}lcc}
+%% \toprule
+%% &&\multicolumn2c{$Y$= Decrease in Surface Tension}\\
+%% \multicolumn2c{$x$ = Weight \% sulfur}
+%% &\multicolumn2c{(dynes/cm), two Replicates}\\
+%% \midrule
+%% 0.&034&301&316\\
+%% 0.&093&430&422\\
+%% 011.&30&593&586\\
+%% \bottomrule
+%% \end{tabular}
+
+
+%% \subexer{Find the transformations of $X$ and $Y$ sot that in the transformed scale 
+%% the regression is linear.}
+
+%% \subexer{Assuming that $X$ is transformed to $\ln(X)$, which choice of $Y$ gives 
+%% better results,
+%% $Y$ or $\ln(Y)$? (Sclove, 1972).}
+
+%% \sidebysidesubsubexer{In the case of $\Delta_1$?}{In the case of $\Delta_2$?}
+
+%% \exer{Examine the Longley data, Problem 3.3, for applicability of assumptions of the
+%% linear model.}
+
+%% \sidebysidesubexer{In the case of $\Gamma_1$?}{In the case of $\Gamma_2$?}
+%% \[
+%%     t= \frac{5}{256}\, \frac{c^5}{G^3}\,
+%%     \frac{r^4}{(m_1m_2)(m_1+m_2)}.  
+%% \]
+
+%% \end{exercises}
+
+%% \begin{chapappendix}[Chapter Appendix: Dark Matter Is Not Composed of Black Holes]
+
+%% \section{The Canada France Hawaii Lensing Survey}
+
+%% Did you know that less than 4\% of our Universe is made up of regular
+%% matter - the type that makes up the Earth, the planets and the stars?
+%% The rest is 'dark' and invisible, but we know that it is there through
+%% its effects on the regular matter that we can see. The gravity of Dark
+%% Matter causes galaxies to clump together in a giant cosmic web, and
+%% Dark Energy is pushing space itself apart at an accelerated rate. With
+%% some of the world's best telescopes we can directly witness the
+%% ongoing battle between these two strange entities.
+
+%% \subsection{CFHTL}
+%% The Canada-France-Hawaii Telescope Lensing Survey uses an innovative
+%% technique called gravitational lensing to observe the invisible dark
+%% matter in our Universe. Using data accumulated over five years by the
+%% CFHT Legacy Survey, the CFHTLenS team have analysed the images of over
+%% 10 million galaxies. The light emitted by these galaxies has taken
+%% nearly half the age of the Universe to reach us and has been bent and
+%% distorted by the massive clumps of dark matter it has passed by.
+%% Exploiting this fact that `mass bends light', as predicted by
+%% Einstein, we have privileged access to the mysterious components of
+%% the Universe that cannot otherwise be observed.
+
+%% \section{Dark Matter and Black Holes}
+%% We know that dark matter exists because of our mathematical graphs of
+%% how fast the material in a galaxy is rotating in relation to the
+%% center of the galaxy (where most of the galactic material is located).
+%% And as a result of these graphs, we know that dark matter surrounds
+%% galaxies. In the end, the farther out you go, the more mass
+%% grows\ldots and
+%% it grows by a lot. So in short, we know that dark matter isn’t just
+%% some black hole that exists out in the middle of intergalactic space
+%% based on the way that galaxies rotate and evolve over time.
+
+%%  As Emma Grocutt, from the
+%% CFHTL Survey notes:\index{authors}{Grocutt, Emma}
+
+%% \begin{extract}
+%% The most interesting thing about dark matter is not simply that we
+%% can't see it, it's that we know dark matter is not made of the same
+%% stuff as normal baryonic matter. This is actually why we can't see
+%% it---baryons interact with each other through gravity, nuclear forces and
+%% the electrostatic force. These interactions are what allow baryonic
+%% matter (such as stars) to emit light, and what prevent you from
+%% putting your hand through a table---the particles of your hand are
+%% electrostatically repelled from the particles in the table. Dark
+%% matter, however, only interacts through gravity. This is why we see
+%% its effects on the motions of galaxies and stars, but why we can't see
+%% it directly; it does not emit or absorb light. Dark matter particles
+%% can also pass through regular matter almost completely undetected
+%% since they don't interact electrostatically, meaning we can't touch it
+%% or sense it in any direct way.
+%% \end{extract}
+
+%% \end{chapappendix}
+
+%% \setcounter{chapter}{2}
+
+%% \clearpage
+
+\appendix
+
+%% \chapter{Evaluating the Significance of the Proof of Gravity
+%% Waves} 
+
+%% \section{On a Par with Determination of Structure of DNA}
+
+
+%% Prof Karsten Danzmann, from the Max Planck Institute for
+%% \index{authors}{Danzmann, Karsten}
+%% \index{subject}{Max Planck Institute for Gravitational Physics}
+%% Gravitational Physics and Leibniz University in Hannover, Germany, is
+%% a European leader on the collaboration.\footnote{Text and graphics
+%% from
+%% \url{http://www.bbc.com/news/science-environment-35524440}}
+
+%% He said the detection was one of the most important developments in
+%% science since the discovery of the Higgs particle, and on a par with
+%% the determination of the structure of DNA.
+%% \index{subject}{Nobel Prize}
+
+%% \begin{figure}[h!]
+%% %\centerline{\includegraphics[width=\textwidth]{gravwaves}}
+%% \vspace{2pt}
+%% \caption{Graphic showing two black holes generating gravity waves.}
+%% \end{figure}
+
+%% ``It is the first ever direct detection of gravitational waves; it's
+%% the first ever direct detection of black holes and it is a
+%% confirmation of General Relativity because the property of these black
+%% holes agrees exactly with what Einstein predicted almost exactly 100
+%% years ago.''\index{authors}{Einstein, Albert}
+%% \index{subject}{Albert Einstein!General Relativity}
+%% \begin{equation}
+%% d\tau^2=B(r)dt^2 - A(r)dr^2-r^2 \sin^2\theta\, d\phi^2.
+%% \end{equation}
+
+%% \begin{sidewaysfigure}
+%% %\includegraphics[width=\textheight]{gravwaves}
+%% \vspace{-11pt}
+%% \caption{Graphic showing two black holes generating gravity waves.
+%% (rotated figure)}
+%% \end{sidewaysfigure}
+
+%% \begin{sidewaystable}
+%% \begin{center}
+%% \begin{threeparttable}
+%% \caption{More relevant tabular information.\label{tbl-2}}\tabfont
+%% \begin{tabular}{@{}lrrrrrrrrrrr}
+%% \toprule
+%% Star & Height & $d_{x}$ & $d_{y}$ & $n$ & $\chi^2$ & $R_{maj}$ & $R_{min}$ &
+%% \multicolumn{1}{c}{$P^a$} & $P R_{maj}$ & $P R_{min}$ &
+%% \multicolumn{1}{c}{$\Theta^b$} \\
+%% \midrule
+%% 1 &33472.5 &-0.1 &0.4  &53 &27.4 &2.065  &1.940 &3.900 &68.3 &116.2 &-27.639\\
+%% 2 &27802.4 &-0.3 &-0.2 &60 &3.7  &1.628  &1.510 &2.156 &6.8  &7.5 &-26.764\\
+%% 3 &29210.6 &0.9  &0.3  &60 &3.4  &1.622  &1.551 &2.159 &6.7  &7.3 &-40.272\\
+%% 4 &32733.8 &-1.2\rlap{\tnote{$c$}} &-0.5 &41 &54.8 &2.282  &2.156 &4.313 &117.4 &78.2 &-35.847\\
+%% 5 & 9607.4 &-0.4 &-0.4 &60 &1.4  &1.669\rlap{\tnote{$c$}} &1.574 &2.343 &8.0  &8.9 &-33.417\\
+%% 6 &31638.6 &1.6  &0.1  &39 &315.2 & 3.433 &3.075 &7.488 &92.1 &25.3 &-12.052\\
+%% \bottomrule
+%% \end{tabular}
+%% \begin{tablenotes}[flushleft]\footnotesize
+%% \item[$a$]Sample footnote for table~\ref{tbl-2} that was
+%% generated with the \LaTeX\ table environment
+%% \item[$b$]Yet another sample footnote for table
+%% \ref{tbl-2}
+%% \item[$c$]Another sample footnote for
+%% table~\ref{tbl-2}
+%% \end{tablenotes}
+%% \end{threeparttable}
+%% \end{center}
+%% \end{sidewaystable}
+
+
+%% \section{Ripples in the Fabric of Space-Time}
+
+%% \begin{itemize}
+%% \item
+%%     Gravitational waves are a prediction of the Theory of General
+%%     Relativity 
+%% \item
+%%     Their existence has been inferred by science but only now
+%%     directly detected 
+%% \item
+%%     They are ripples in the fabric of space and time produced by
+%%     violent events 
+%% \item
+%%     Accelerating masses will produce waves that propagate at the
+%%     speed of light 
+%% \item
+%%     Detectable sources ought to include merging black holes and
+%%     neutron stars 
+%% \item
+%%     Ligo fires lasers into long, L-shaped tunnels; the waves disturb
+%%     the light 
+%% \item
+%%     Detecting the waves opens up the Universe to completely new
+%%     investigations 
+%% \end{itemize}
+
+
+%% \subsection{Stephen Hawking Agrees on Importance}
+%% That view was reinforced by Prof Stephen Hawking, who is an expert on
+%% black holes.\footnote{Perhaps somewhat immodestly, 
+%% this claim is made
+%% on Hawking's website (\url{www.hawking.org.uk}):
+%% ``Stephen Hawking is regarded as one of the
+%% most brilliant theoretical  physicists since Einstein.''
+%% Though, of course, it may well be true!}
+%% Speaking exclusively to BBC News, he said he believed
+%% that the detection marked a key moment in scientific history.\endnote{Stephen Hawking said that the detection of gravity waves
+%% marked a key moment in scientific history.}
+%% \index{authors}{Hawking, Stephen}
+
+%% ``Gravitational waves provide a completely new way at looking at the
+%% Universe. The ability to detect them has the potential to
+%% revolutionise astronomy. This discovery is the first detection of a
+%% black hole binary system and the first observation of black holes
+%% merging,'' he said.
+
+%% ``Apart from testing (Albert Einstein's theory of) General Relativity,
+%% we could hope to see black holes through the history of the Universe.
+%% We may even see relics of the very early Universe during the Big Bang
+%% at some of the most extreme energies possible.''
+%% \index{authors}{Albert Einstein}
+
+%% \subsection{Too Beautiful to Be True?}
+%% We found a beautiful signature of the merger of two black holes and
+%% it agrees exactly - fantastically\nobreak - with the numerical solutions to
+%% Einstein equations\ldots it looked too beautiful to be true," said Prof
+%% Danzmann.\index{subject}{beauty}\index{subject}{truth}\index{subject}{truth and
+%% beauty!truth}\index{subject}{beauty and truth!beauty}
+
+\backmatter
+
+%% \addtocontents{toc}{\vspace{11pt}}
+
+%% \begin{glossary}
+%% \term{Absolute Zero}{
+%% The lowest temperature possible, equivalent to -273.15$^{\deg}$C (or
+%% 0$^{\deg}$ on the
+%% absolute Kelvin scale), at which point atoms cease to move altogether
+%% and molecular energy is minimal. The idea that it is impossible,
+%% through any physical process, to lower the temperature of a system to
+%% zero is known as the Third Law of Thermodynamics.}
+%% \index{subject}{Absolute zero}
+%% \index{subject}{Third Law of Thermodynamics}
+
+%% \term{Alpha Particle (Alpha Decay)}{A particle of 2 protons and 2 neutrons (essentially a helium nucleus)
+%% that is emitted by an unstable radioactive nucleus during radioactive
+%% decay. It is a relatively low-penetration particle due its
+%% comparatively low energy and high mass.}
+%% \index{subject}{Alpha Particle}
+
+%% \term{Angular Momentum}{A measure of the momentum of a body in rotational
+%% motion about its centre of mass. Technically, the angular momentum of
+%% a body is equal to the mass of the body multiplied by the cross
+%% product of the position vector of the particle with its velocity
+%% vector. The angular momentum of a system is the sum of the angular
+%% momenta of its constituent particles, and this total is conserved
+%% unless acted on by an outside force.}
+
+%% \term{Anthropic Principle}
+%% {The idea that the fundamental constants of physics and chemistry are
+%% just right (or ``fine-tuned'') to allow the universe and life as we know
+%% it to exist, and indeed that the universe is only as it is because we
+%% are here to observe it. Thus, we find ourselves in the kind of
+%% universe, and on the kind of planet, where conditions are ripe for our
+%% form of life.}
+
+%% \term{Antimatter}{Pair production and pair annihilation
+%% of hydrogen and antihydrogen particles. 
+%% A large
+%% accumulation of antiparticles---antiprotons, antineutrons and
+%% positrons (antielectrons)---which have opposite properties to normal
+%% particles (e.g. electrical charge), and which can come together to
+%% make antiatoms. When matter and antimatter meet, they self-destruct in
+%% a burst of high-energy photons or gamma rays. The laws of physics seem
+%% to predict a pretty much 50/50 mix of matter and antimatter, despite
+%% the observable universe apparently consisting almost entirely of
+%% matter, known as the ``baryon asymmetry problem.''}
+%% \index{subject}{antimatter}
+%% \index{subject}{antimatter, definition of}
+%% \index{subject}{baryon asymmetry problem}
+
+%% \end{glossary}
+
+%% \begin{endbookexercises}
+%% \exer{For Hooker's data, Exercise 1.2, use the Box and Cox and Atkinson procedures to determine a appropriate transformation of PRES
+%% in the regression of PRES on TEMP. find $\hat\lambda$, $\tilde\lambda$,
+%% the score test, and the added variable plot for the score. 
+%% Summarize the results.}
+
+%% \subexer{The following data were collected in a study of the effect of dissolved sulfur
+%% on the surface tension of liquid copper (Baes and Killogg, 1953).}
+
+%% \hspace{3.5pt}\begin{tabular}{rlcc}
+%% \toprule
+%% &&\multicolumn2c{$Y$= Decrease in Surface Tension}\\
+%% \multicolumn2c{$x$ = Weight \% sulfur}
+%% &\multicolumn2c{(dynes/cm), two Replicates}\\
+%% \midrule
+%% 0.&034&301&316\\
+%% 0.&093&430&422\\
+%% 0.&30&593&586\\
+%% \bottomrule
+%% \end{tabular}
+
+%% \subexer{Find the transformations of $X$ and $Y$ sot that in the transformed scale 
+%% the regression is linear.}
+
+%% \subexer{Assuming that $X$ is transformed to $\ln(X)$, which choice of $Y$ gives 
+%% better results,
+%% $Y$ or $\ln(Y)$? (Sclove, 1972).}
+
+%% \sidebysidesubsubexer{In the case of $\Delta_1$?}{In the case of $\Delta_2$?}
+
+%% \exer{Examine the Longley data, Problem 3.3, for applicability of assumptions of the
+%% linear model.}
+
+%% \sidebysidesubexer{In the case of $\Gamma_1$?}{In the case of $\Gamma_2$?}
+
+%% \[
+%%     t= \frac{5}{256}\, \frac{c^5}{G^3}\,
+%%     \frac{r^4}{(m_1m_2)(m_1+m_2)}.  
+%% \]
+
+%% \end{endbookexercises}
+
+%% \theendnotes
+
+%% \nocite{*} is a way to get all the entries in the .bib file to print in the bibliography:
+\nocite{*}\let\bibname\refname
+\addcontentsline{toc}{fmbm}{\refname}
+\printbibliography
+
+%% \begin{contributors}[twocolumn]
+
+%% \contrib 
+%% Professor Alan Guth\\
+%% Center for Theoretical Physics\\
+%% Massachusetts Institute of Technology\\
+%% Cambridge, Massachusetts, USA
+
+%% \contrib 
+%% Professor Andrei Linde\\
+%% Department of Physics\\
+%% Stanford University\\
+%% Stanford, CA, USA
+%% \end{contributors}
+
+ \printindex{authors}{Author Index}
+ \printindex{subject}{Subject Index}
+
+
+\end{document}
+

+ 65 - 0
multind.sty

@@ -0,0 +1,65 @@
+% indexes document style option for producing multiple indexes
+% for use with the modified bbok style, CHbook.sty
+% Written by F.W. Long, Version 1.1, 12 August 1991.
+
+% Modified by F.W. Long, Version 1.1a, 29 August 1991
+% to get the index heading correctly spaced.
+
+% Modified by F.W. Long, Version 1.1b, 31 August 1991
+% to remove the abbreviation \ix (which should be in the document, not here).
+
+% Modified \makeindex and \index commands to allow multiple indexes
+% in both cases the first parameter is the index name.
+% They now work more like \@starttoc and \addcontentsline.
+% \index is no longer defined inside \makeindex but determines
+% whether the appropriate file is defined before writing to it.
+
+\def\makeindex#1{\begingroup
+  \makeatletter
+  \if@filesw \expandafter\newwrite\csname #1@idxfile\endcsname
+  \expandafter\immediate\openout \csname #1@idxfile\endcsname #1.idx\relax
+  \typeout{Writing index file #1.idx }\fi \endgroup}
+
+\def\index#1{\@bsphack\begingroup
+               \def\protect##1{\string##1\space}\@sanitize
+               \@wrindex{#1}}
+
+% \@wrindex now checks that the appropriate file is defined.
+
+\def\@wrindex#1#2{\let\thepage\relax
+   \xdef\@gtempa{\@ifundefined{#1@idxfile}{}{\expandafter
+      \write\csname #1@idxfile\endcsname{\string
+      \indexentry{#2}{\thepage}}}}\endgroup\@gtempa
+   \if@nobreak \ifvmode\nobreak\fi\fi\@esphack}
+
+% Modified \printindex command to allow multiple indexes.
+% This now takes over much of the work of \theindex.
+% Again, the first parameter is the index name.
+% The second parameter is the index title (as printed).
+
+\newif\if@restonecol
+\def\printindex#1#2{\@restonecoltrue\if@twocolumn\@restonecolfalse\fi
+  \columnseprule \z@ \columnsep 35pt
+  \newpage \twocolumn[{\Large\bf #2 \vskip4ex}]
+  \markright{\uppercase{#2}}
+  \addcontentsline{toc}{section}{#2}
+  \@input{#1.ind}}
+
+% The following index commands are taken from book.sty.
+% \theindex is modified to not start a chapter.
+
+\def\theindex{\parindent\z@
+ \parskip\z@ plus .3pt\relax\let\item\@idxitem}
+\def\@idxitem{\par\hangindent 40pt}
+\def\subitem{\par\hangindent 40pt \hspace*{20pt}}
+\def\subsubitem{\par\hangindent 40pt \hspace*{30pt}}
+\def\endtheindex{\if@restonecol\onecolumn\else\clearpage\fi}
+\def\indexspace{\par \vskip 10pt plus 5pt minus 3pt\relax}
+
+% the command \ix allows an abbreviation for the general index
+
+%\def\ix#1{#1\index{general}{#1}}
+
+% define the \see command from makeidx.sty
+
+\def\see#1#2{{\em see\/} #1}

Nem az összes módosított fájl került megjelenítésre, mert túl sok fájl változott