22 11 19

multiple predicate cawp x takes too long (with calls following commands, max depth 8)
instead, single predicate, cawp dictionary-less random, ui, mr

- still asks about transformations at start to write spec
	- can omit types - just input or output modes (types from multi-predicates) - just asks name of variable and value
	- e.g. check type, if value then add, if member then append, if member then delete and add
	(verify, map or delete)
	- verify - doesn't append or output
	- map - outputs, doesn't delete
	- delete - outputs, deletes
- data from brdict (x to above - need types to find appropriate transformation, (e.g. notes to transpose, words to recognise or any possible transformation for a type1's type (x to brdict words x uses brdict, etc. to generate data - adds type1 and type to typedict, has a commanddict of commands that transform one type of another - could transform, then use an earlier value to output like CAW, so must match spec's output x randomly/etc uses alg's output - has a single output), x:
funnel to music composer lyrics where verbs have particular computational verb meanings)

avoid lists to avoid list structure errors, compound types
- need to verify posited numbers are numbers - done by interpreter
- string length can be same for 2 strings
	- using type transformations from commanddict, so has 1 solution
- random, mr and ui choose from computed algs - ui with different choicepoints x

- later: animals' own brdicts - should check meaning of word is correct, and confirm new words are wanted (may use words differently - record definition and when used)

24 11 19

prepare for multiple clauses and predicates
- lists and compound types
- find type statements from predicates
- write algs from compound type statement that is combination of predicate specifications (specification at start)
- functional types, recursive data dictionaries, recursive types
- can find items in dictionaries with query and synonyms (may need separate lookup alg)
(- may need supercomputer if uses predicate dictionaries or is over certain max depth)
- instead of caw, could traverse old predicates using tree of choice-points (for simple algs), also use appropriate commands for data (using types) (also string (writes alg with constant substrings in it), list (uses wrap and unwrap) and state machine (for cyclic data that has more predicates that need to be tracked using 4+ states, state machine if has 2 uses) finders, where need to simplify state machine)