Index: doc/refrat/refrat.tex
===================================================================
--- doc/refrat/refrat.tex	(revision c8771e93e6d4564902cf2d844a910b7d37038815)
+++ doc/refrat/refrat.tex	(revision c9c9ac4f37b1932b3b5d84b2da1ab654a58e3069)
@@ -11,6 +11,6 @@
 %% Created On       : Wed Apr  6 14:52:25 2016
 %% Last Modified By : Peter A. Buhr
-%% Last Modified On : Tue Aug 15 18:46:31 2017
-%% Update Count     : 106
+%% Last Modified On : Wed Jan 31 17:30:23 2018
+%% Update Count     : 108
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
@@ -141,6 +141,5 @@
 The manual deliberately imitates the ordering of the \Celeven standard (although the section numbering differs).
 Unfortunately, this means the manual contains more ``forward references'' than usual, making it harder to follow if the reader does not have a copy of the \Celeven standard.
-For a simple introduction to \CFA, see the companion document ``An Overview of \CFA''
-\cite{Ditchfield96:Overview}.
+For a simple introduction to \CFA, see~\cite{Cforall}.
 
 \begin{rationale}
@@ -596,5 +595,5 @@
 \begin{rationale}
 Since each subsection describes the interpretations of an expression in terms of the interpretations of its subexpressions, this chapter can be taken as describing an overload resolution algorithm that uses one bottom-up pass over an expression tree.
-Such an algorithm was first described (for Ada) by Baker~\cite{Bak:overload}.
+Such an algorithm was first described (for Ada) by Baker~\cite{Baker82}.
 It is extended here to handle polymorphic functions and arithmetic conversions.
 The overload resolution rules and the predefined functions have been chosen so that, in programs that do not introduce overloaded declarations, expressions will have the same meaning in C and in \CFA.
@@ -3775,5 +3774,5 @@
 
 \bibliographystyle{plain}
-\bibliography{cfa}
+\bibliography{pl}