Author preprint

snowleopard · Jul 18, 2017 · 63d5d65 · 63d5d65
1 parent da690cc
commit 63d5d65
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 5 deletions.
diff --git a/alga.tex b/alga.tex
@@ -1,4 +1,4 @@
-\documentclass[sigplan]{acmart}
+\documentclass[sigplan,authorversion]{acmart}
 
 \usepackage{booktabs}
 \usepackage{subcaption}
@@ -37,7 +37,7 @@
 }
 
 \begin{abstract}
-\vspace{-1mm}
+% \vspace{-1mm}
 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
@@ -66,7 +66,8 @@
 \end{CCSXML}
 
 \ccsdesc[500]{Mathematics of computing~Graph theory}
-\keywords{\vspace{-2mm}Haskell, algebra, graph theory}
+%\keywords{\vspace{-2mm}Haskell, algebra, graph theory}
+\keywords{Haskell, algebra, graph theory}
 
 \maketitle
 

diff --git a/intro.tex b/intro.tex
@@ -1,7 +1,7 @@
 %!TEX root = alga.tex
-\vspace{-2mm}
+%\vspace{-2mm}
 \section{Introduction}\label{sec-intro}
-\vspace{-0.5mm}
+%\vspace{-0.5mm}
 
 Graphs are ubiquitous in computing, yet working with graphs often requires
 painfully low-level fiddling with sets of vertices and edges. Building high-level