Index: doc/papers/general/Paper.tex
===================================================================
--- doc/papers/general/Paper.tex	(revision 92f8e186429e9bdf92b7aeb6a8defdbbf5ec2dfd)
+++ doc/papers/general/Paper.tex	(revision 826a67cdbde0b78ea2a03b679955aceaeb417cee)
@@ -1400,5 +1400,5 @@
 a value that does not have a corresponding address is called a \newterm{rvalue} (for ``right-hand value''), while a value that does have an address is called a \newterm{lvalue} (for ``left-hand value'').
 For example, in @int x; x = 42;@ the variable expression @x@ on the left-hand-side of the assignment is a lvalue, while the constant expression @42@ on the right-hand-side of the assignment is a rvalue.
-In imperative programming, the address of a value is used for both reading and writing (mutating) a value.
+Despite the nomenclature of ``left-hand'' and ``right-hand'', an expression's classification as lvalue or rvalue is entirely dependent on whether it has an address or not; in imperative programming, the address of a value is used for both reading and writing (mutating) a value, and as such lvalues can be converted to rvalues and read from, but rvalues cannot be mutated because they lack a location to store the updated value.
 
 Within a lexical scope, lvalue expressions have an \newterm{address interpretation} for writing a value or a \newterm{value interpretation} to read a value.
@@ -1460,5 +1460,5 @@
 Since pointers and references share the same internal representation, code using either is equally performant; in fact the \CFA compiler converts references to pointers internally, and the choice between them in user code can be made based solely on convenience.
 
-By analogy to pointers, \CFA references also allow cv-qualifiers:
+By analogy to pointers, \CFA references also allow cv-qualifiers such as @const@:
 
 \begin{cfa}