libera/#commonlisp - IRC Chatlog
Search
1:50:24
ludston
My example of an O(n^2) algorithm is contrived, but yes there are algorithms where O(n^2) is optimal. Algorithms like O(n^m) are pretty rare though, given the run-time tends to become infinite when you have more than 10 elements.
3:06:20
beach
I don't have the paper fresh in memory, but as I recall, each invocation takes a logarithmic amount of stack space. It would appear to me then, that a quadratic algorithms would take logĀ² space.
3:34:09
beach
I added two more papers to http://metamodular.com/SICL today, namely "A modern implementation of the LOOP macro", and "Removing redundant tests by replicating control paths."
13:33:43
pjb
It' strange that compiler-macro-function takes an environment parameter, but it can only be NIL for (setf compiler-macro-function).
13:38:07
Bike
compiler-macro-function needs it because compiler macros can be shadowed by local functions
13:38:22
Bike
but also, typep and subtypep and find-class take environment parameters, and there's no concept of local types
13:39:44
beach
Can those just be different global environments, like the ones mentioned for file compilation?
13:43:47
beach
So it looks like DEFTYPE can be defined in the compilation environment, so the environment to TYPEP and SUBTYPEP could be a compilation environment.
13:45:15
jackdaniel
could it be that find-class when used with compilation environment yields a forward referenced class instance standing for a class that is defined in this compilation unit?