10:07:38lisbethsbecause you can implement balanced binary search trees in pure untyped unnamed lambda calculus, that shows that LC is capable of a good big O notation for general purpose algorithms
10:08:45lisbethsI wonder what work has been done in pure lambda calculus besides just church encoding
10:09:01moon-childlisbeths: I already told you lambda calculus does not specify a cost model
10:09:36moon-childlisbeths: see okasaki, 'purely functional data structures'
10:11:29lisbethscost models are not how I measure this Big O performance
10:12:04lisbethsi reason about how it can perform based on the facts
10:12:29lisbethsa balanced binary search tree can simulate contiguous memory