\documentclass[12pt]{article}

\usepackage{times,mathptm}
\pagestyle{myheadings}



\parindent 0in
\setlength{\parindent}{0in}
\setlength{\parskip}{1ex}

\topmargin -0.1in \headheight\baselineskip
\textheight 8.5in         % 1in top and bottom margin
\textwidth 6.5in        % 1in left and right margin
\oddsidemargin 0in
\evensidemargin 0in




%\usepackage{amsmath}
%\usepackage{amssymb}


% \setlength{\itemsep}{0pt}

\markright{\footnotesize CS 451 Programming Paradigms, Spring 2001}

\begin{document}

\section*{Homework set 13: Simple programs in ML --- due Monday 19 March}

Total number of points available on this homework is 100. Full credit
is equivalent to 100 points.


\begin{enumerate}

\item  (15 pts.)  String manipulation.
Do Exercise 3.3.9 from Ullman (p. 76).

\item  (20 pts.)  String manipulation.
Do Exercise 3.3.10 from Ullman (p. 76).

\item  (15 pts.)  Representing sets using lists.
Do Exercise 3.3.11 from Ullman (p. 76).

\item  (30 pts.)  Representing sets using lists.
Do Exercise 3.3.13 from Ullman (p. 76).

\item   (20 pts.)
If \textit {xs} is a list, the evaluation of 
\textit{map} \textit{f} (\textit{map} \textit{g} \textit{xs})
requires two traversals of a list.
Simplify the expression so that only one traversal is needed.


\end{enumerate}


\end{document}

