project.tex

\documentclass[12pt]{article}

\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage[letterpaper]{geometry}
\usepackage{mathrsfs}
\usepackage{setspace}
\usepackage[overload]{textcase}
\usepackage{array}
\usepackage{xspace}
\usepackage{color}
\usepackage{epic}

\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{case}{Case}[theorem]
\newtheorem{subcase}{Case}[case]

\begin{document}

\title{Interoperation for Lazy and Eager Evaluation}
\author{William Faught}
\date{May 10, 2011}
\maketitle

\begin{abstract}
Programmers forgo existing solutions to problems in other programming languages where software interoperation proves too cumbersome; they remake solutions, rather than reuse them. To facilitate reuse, interoperation must resolve language incompatibilities transparently. To address part of this problem, we present a model of computation that resolves lazy and eager evaluation strategies using dual notions of evaluation contexts and values to mirror the lazy evaluation strategy in the eager one. This method could be extended to resolve incompatible evaluation contexts for expressions common to any pair of languages.
\end{abstract}

\input{macros.tex}
\input{section1.tex}
\input{section2.tex}
\input{section3.tex}

\clearpage

\bibliography{bibliography}
\bibliographystyle{plain}

\end{document}