Index: doc/generic_types/generic_types.tex
===================================================================
--- doc/generic_types/generic_types.tex	(revision eb79750f5b67b2ba4b2b6271db089b2f3ab6fae2)
+++ doc/generic_types/generic_types.tex	(revision ab16fc5c5dcde06789b487c9fd51a9df93a9d30a)
@@ -950,8 +950,8 @@
 This claim is demonstrated through a set of generic-code-based micro-benchmarks in C, \CFA, and \CC (see stack implementations in Appendix~\ref{sec:BenchmarkStackImplementation}).
 Since all these languages share a subset comprising standard C, maximal-performance benchmarks would show little runtime variance, other than in length and clarity of source code.
-A more illustrative benchmark is to show the costs of idiomatic use of each language's features covering common usage.
+A more illustrative benchmark is the idiomatic costs of each language's features covering common usage.
 Figure~\ref{fig:BenchmarkTest} shows the \CFA benchmark tests for a generic stack based on a singly linked-list, a generic pair-data-structure, and a variadic @print@ routine similar to that in Section~\ref{sec:variadic-tuples}.
 The benchmark test is similar for C and \CC.
-The experiment uses element types @int@ and @pair(_Bool, char)@, and pushes $N=40M$ elements on a generic stack, copies the stack, clears one of the stacks, finds the maximum value in the other stack, and prints $N$ constant values.
+The experiment uses element types @int@ and @pair(_Bool, char)@, and pushes $N=40M$ elements on a generic stack, copies the stack, clears one of the stacks, finds the maximum value in the other stack, and prints $N/2$ (to reduce graph height) constants.
 
 The structure of each benchmark implemented is: C with @void *@-based polymorphism, \CFA with the presented features, \CC with templates, and \CC using only class inheritance for polymorphism, called \CCV.
@@ -973,6 +973,5 @@
 	TIMED( "clear_int", clear( &si ); )
 	REPEAT_TIMED( "pop_int", N, 
-		int xi = pop( &ti ); 
-		if ( xi > maxi ) { maxi = xi; } )
+		int xi = pop( &ti ); if ( xi > maxi ) { maxi = xi; } )
 	REPEAT_TIMED( "print_int", N/2, print( out, vali, ":", vali, "\n" ); )
 
@@ -984,6 +983,5 @@
 	TIMED( "clear_pair", clear( &sp ); )
 	REPEAT_TIMED( "pop_pair", N, 
-		pair(_Bool, char) xp = pop( &tp ); 
-		if ( xp > maxp ) { maxp = xp; } )
+		pair(_Bool, char) xp = pop( &tp ); if ( xp > maxp ) { maxp = xp; } )
 	REPEAT_TIMED( "print_pair", N/2, print( out, valp, ":", valp, "\n" ); )
 	fclose(out);