freenode/#clasp - IRC Chatlog
Search
13:55:13
karlosz
getting a dynamic reloc error asking me to recompile with PIC on arch after updating
13:55:14
Colleen
karlosz: Bike said 16 hours, 23 minutes ago: load whatever version of sicl as the local mirror src/lisp/kernel/contrib/sicl. note that distclean will reset it
13:56:20
karlosz
i remember haring something was wrong with arch popping up in the last month. anyone ever found a conclusive fix.
13:58:59
Bike
what is available in rmps? the compiler clearly exists, but cl:compile is an undefined function?
14:02:58
drmeister
That's not to say that even at this late, late stage of clasp development - that in this early, early stage of the build, symbols aren't put into the correct packages.
14:25:27
Bike
drmeister: do you know what kind of problem would cause compilation to work okay, but not the next step (linking i think)? maybe an intrinsic written wrong?
18:36:25
karlosz
in terms of eliminating unneceessary closures, we can inline functions which don't escape. for recursive functions, would it be better to lambda lift them?
18:39:48
karlosz
closures are expensive to make in clisp, im not sure if passing an arg would be faster in all implementations
0:11:51
WhoTookMyName
Hello, is there any way I can get a binary? I don't think I have the resources to generate one. I can run a VM for whatever system.
1:22:29
karlosz
a very useful optimization for more functoinal programs: contification. i.e. transforming tail calls between local functions into the first order flow graph. ie. making something like (labels ((loop* () (loop*))) ()) compile to the same code as (loop)
1:22:53
karlosz
and the paper https://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&ved=2ahUKEwjp3tDHpdzcAhVFjlQKHSIZA2wQFjABegQIBhAC&url=http%3A%2F%2Fwww.mlton.org%2Fguide%2F20130715%2FReferences.attachments%2FFluetWeeks01.pdf&usg=AOvVaw2PLS7OE1h8ISNrg_kZWrys
1:26:06
karlosz
that way you can utilize all the first order optimizations and not have to reason about higher order functions
1:40:59
karlosz
im not quite sure why dominance information is needed in the original paper though; our ir doesn't express continuation information explicitly but it seems like its enough just to check for tail recursive calls and let inlining take care of the rest