14:39 <bremner> is it reasonable that (build-list 10000000 identity) needs more than 128M of memory? this in drracket 7.1

14:40 <bremner> it's a bit ironic because I'm building a big list to demo tail recursion

14:45 <bremner> golly. 300M after gc

14:47 <bremner> I guess 30 bytes per cons cell is not crazy

14:53 <profmakx> drracket uses almost 300megs by itself without having done anything

14:54 <profmakx> (or do you have a way to measure the memory use of that list/)

15:01 <bremner> the (command line) racket-repl there's (dump-memory-stats), but it doesn't seem to do anything in drracket

15:01 <dansa> I've been `processing' the literature (since the 80s and 90s to present time) on DSL and trying to understand the state-of-the-art of building and applying DLS to problems-in-general and I'm surprised to see how little Lisp languages are mentioned. I haven't found yet a single mention of PLT Scheme and more interestingly no mention of Racket at all. (I have read various papers from the first

15:01 <dansa> decade of the current century.) Is this really the situation?

15:02 <bremner> profmakx: I'm assuming that the 128M default memory limit of drracket doesn't include drracket itself, or nothing would run