Index: doc/working/resolver_design.md
===================================================================
--- doc/working/resolver_design.md	(revision 66999e7301961ec52f052efa4bd0f2618380dad9)
+++ doc/working/resolver_design.md	(revision 59f9273d9a7dab609bcd3010343a3b307a0eb221)
@@ -1414,4 +1414,13 @@
 considered if no match was found in the previous class.
 
+Another source of efficiency would be to cache the best given interpretation 
+of a subexpression within an environment; this may not be incredibly useful 
+for explict parameters (though it may be useful for, e.g. `f( x, x )`, where 
+both parameters of `f` have the same type), but should pay some dividends for 
+the implicit assertion parameters, especially the otype parameters for the 
+argument of a generic type, which will generally be resolved in duplicate for 
+(at least) the assignment operator, constructor, copy constructor & destructor 
+of the generic type. 
+
 ## Appendix A: Partial and Total Orders ##
 The `<=` relation on integers is a commonly known _total order_, and