Permalink
Browse files

Use Bennets paper for reversible TMs.

  • Loading branch information...
1 parent c81c07b commit b8082307a17c9fb77beca2f2e26353f6c3d1e2dd @jlouis committed May 21, 2009
Showing with 1 addition and 1 deletion.
  1. +1 −1 report/intro.tex
View
@@ -88,7 +88,7 @@ \chapter{Introduction}
\subsection{Related work}
There are several examples of reversible programming languages:
-reversible Turing machines \cite{morita+2007:reversible-tm},
+reversible Turing machines \cite{bennett+1973:LRC},
functional languages \cite{glueck+2005:program-inverter} etc.. There
are also many examples of programming language formalizations with a
large diversity: functional languages

0 comments on commit b808230

Please sign in to comment.