On Thu, Feb 26, 2009 at 7:12 PM, Jonathan S. Shapiro <[email protected]> wrote: > On Thu, Feb 26, 2009 at 9:59 PM, Pal-Kristian Engstad > <[email protected]> wrote: >> Guarantees about stack and heap usage: Stacks do sometimes grow into memory >> where they shouldn't, causing the game to crash... > > Concur. What you are after here is termination. I don't think the > language should mandate this, but it should be something that is > dischargeable, and usually with a fairly high degree of automation. > These sorts of things are very much the kinds of issues that concern > us in the Coyotos kernel. > >> Run-time guarantees: If it looks like an O(n) routine, then it should be an >> O(n) routine. > > Yes. And without any hidden constant multipliers, thank you. > > Though in practice O(N log N) *is* O(N). N in representable program > states is bounded by the total number of electrons in the universe, > and logN of that is surprisingly small. I have annoyed several > algorithms faculty with this observation over the years.
log N is about 10 or 20, and I don't think assuming 10 = O(1) is a good idea. Geoffrey _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
