oh yeah

1 files changed, 10 insertions, 3 deletions

diff --git a/final_project/work/description b/final_project/work/description
index 8768e08..a5c7977 100644
--- a/final_project/work/description
+++ b/final_project/work/description
@@ -8,7 +8,8 @@ sense of the word, but in the s-expression sense of the word) and determine
 the set of procedures which /could/ be applied to it based on type predicates
 and present these options interactively to the user in a useful manner.
 
-[Various optimizations to this process will be discussed]
+Lookup for an individual object is O([number of operators]) and O([number
+of predicates per operators]). Memoization could save time here if needed.
 
 We will consider and demonstrate this system in the domains of a) the R5RS
 Scheme builtin types and procedures and b) the scmutils types and special
@@ -23,8 +24,6 @@ Other domains this system could be applied to include:
 Related problems (which could be covered by this work?):
     chaining procedures (eg if f maps A->B and g maps B->C, then gof maps
         A->C which might be what we want
-    some kind 
-
 
 ----------------
 
@@ -61,3 +60,11 @@ operators are displayed; it could also be done as a continuation so that the
 first 10 would be displayed, then there would be a button to view the next 10
 operators (eg, turn the search problem into a stream).
 
+
+-----------
+
+* predicate satisfaction search
+* predicate could be "this is a simple equation"
+* data un-corruption: have a validity predicate
+
+