X-Git-Url: https://scm.cri.mines-paristech.fr/git/pipstransfo.git/blobdiff_plain/db4f136a6b8be6ff148b0b27863c8504e14cd2a7..376c9fa460a27f89aa94f5b0dc2c82f8b4d4dadd:/pipstransfo.tex?ds=sidebyside

diff --git a/pipstransfo.tex b/pipstransfo.tex
index 3c0e935..65ecf0b 100644
--- a/pipstransfo.tex
+++ b/pipstransfo.tex
@@ -7,9 +7,12 @@
 
 \usepackage{listings}
 \usepackage{hyperref}
+\usepackage{xspace}
 
+\def\PIPS{PIPS\xspace}
 
-\title{PIPS~--- List of code transformations}
+
+\title{\PIPS~--- List of code transformations}
 
 
 
@@ -113,7 +116,7 @@
 \item constant propagation
 \end{itemize}
 
-\chapter{List of PIPS transformations}
+\chapter{List of \PIPS transformations}
 
 \section{Memory allocation alteration}
 
@@ -134,8 +137,8 @@
 
 \item[loop unrolling]{
   is a loop transformation.
-  Unrolling a loop by a factor of $n$ consists in the substitution of a loop
-  body by itself, replicated $n$ times. A prelude and/or postlude are
+  Unrolling a loop by a factor of \(n\) consists in the substitution of a loop
+  body by itself, replicated \(n\) times. A prelude and/or postlude are
   added to preserve the number of iteration.}
 
 \item[loop fusion]{
@@ -251,7 +254,7 @@
   operator by its expanded form.}
 
 \item[n address code generation]{is the process of splitting
-  complex expression in simpler ones that take at most $n$ operands.}
+  complex expression in simpler ones that take at most \(n\) operands.}
 
 \item[memory footprint reduction]{is the process of tiling a loop
   to make sure the iteration over the tile has a memory footprint bounded by
