The stack keeps track of important information while the program is running. You will run out of stack space if you end up in an infinite recursion. However, complicated programs without infinite recursion may run out of stack space also and a larger stack size needs to be used. When running the executable produced by ghc, use the +RTS -K option to use a larger stack. • We have problems with our assignment run time, it taks more than 1 hour to run generation 1, yet still return the rusult. Just wondering if it takes too long than supposed, if so, what’s the usual run time for “one generation”? Yes, that’s very slow. Are you using the compiler as described in http://www.cse.unsw.edu.au/~bi1001/part1.html? If so, you may wish to try the profiler to find the slow code. See the section “Profiling your Implementation” on that web page. However, please note that the majority (possibly all) the marks will be based on correctness — not performance. As long as the unit test cases run in
