Switch to author version

alga.tex

@@ -1,4 +1,5 @@
-\documentclass[sigplan,screen,9pt]{acmart}
+% \documentclass[sigplan,screen,9pt]{acmart}
+\documentclass[sigplan,screen,authorversion,9pt]{acmart}
 \usepackage{booktabs}
 \usepackage{subcaption}
 
@@ -38,7 +39,7 @@
 }
 
 \begin{abstract}
-\vspace{-0.5mm}
+% \vspace{-0.5mm}
 The paper presents a minimalistic and elegant approach to working
 with graphs in Haskell. It is built on a rigorous
 mathematical foundation --- an algebra of graphs --- that allows us to apply
@@ -52,7 +53,7 @@
 and transitive graphs, as well as hypergraphs, by appropriately choosing
 the set of underlying axioms. The flexibility of the approach is
 demonstrated by developing a library for constructing
-and transforming polymorphic graphs.\vspace{-1mm}
+and transforming polymorphic graphs.%\vspace{-1mm}
 \end{abstract}
 
 %% 2012 ACM Computing Classification System (CSS) concepts
@@ -68,7 +69,8 @@
 \end{CCSXML}
 
 \ccsdesc[500]{Mathematics of computing}
-\keywords{\vspace{-2mm}Haskell, algebra, graph theory}
+% \keywords{\vspace{-2mm}Haskell, algebra, graph theory}
+\keywords{Haskell, algebra, graph theory}
 
 \maketitle
 

intro.tex

@@ -47,14 +47,14 @@ \section{Introduction}\label{sec-intro}
 Algebraic graphs have a safe and minimalistic core of four graph construction primitives,
 as captured by the following data type:
 
-\vspace{-0.59mm}
+% \vspace{-0.59mm}
 \begin{minted}{haskell}
   data Graph a = Empty
                | Vertex a
                | Overlay (Graph a) (Graph a)
                | Connect (Graph a) (Graph a)
 \end{minted}
-\vspace{-0.59mm}
+% \vspace{-0.59mm}
 
 \noindent
 Here \hs{Empty} and \hs{Vertex} construct the \emph{empty} and \emph{single-vertex} graphs,
@@ -102,7 +102,7 @@ \section{Introduction}\label{sec-intro}
   % with graphs comprising billions of edges in the matter of
   % seconds, which is sufficiently fast for many applications.
 \end{itemize}
-\vspace{-2mm}
+% \vspace{-2mm}
 
 \begin{figure*}
 \begin{subfigure}[b]{0.2\linewidth}