Index: doc/working/resolver_design.md
===================================================================
--- doc/working/resolver_design.md	(revision 40744af8b1bb93262cbdaa65ccf399c6df297cc7)
+++ doc/working/resolver_design.md	(revision bbd44c5f11c2d716639e628e7c0d44ba6a5dc829)
@@ -1382,4 +1382,12 @@
 hypothesis needs to be empirically validated.
 
+Another approach would be to abandon expression-tree ordering for 
+subexpression matching, and order by "most constrained symbol"; symbols would  
+be more constrained if there were fewer matching declarations, fewer 
+subexpressions yet to resolve, or possibly fewer possible types the expression 
+could resolve to. Ordering the expressions in a priority-queue by this metric 
+would not necessarily produce a top-down or a bottom-up order, but would add 
+opportunities for pruning based on memoized upper and lower bounds.
+
 Both Baker and Cormack explicitly generate all possible interpretations of a 
 given expression; thinking of the set of interpretations of an expression as a