21:24:07phoejackdaniel: I actually wonder about the "special" part
21:24:36phoeAFAIK SBCL creates an "undefined" variable, which is global/lexical/shadowable and does not exhibit dynamic behavior
21:25:43phoeas in, on all implementations I can quickly check, (progn (setf foo 42) (defun bar () foo) (defun baz () (let ((foo 24)) (baz))) (bar)) ;=> 42
0:14:53nij-Hi! Is it possible to handle a condition by popping out the choice panel to the user for N seconds, and close the panel to do something else if no choice is provided?
0:22:30Bikenij-: that would have to be a feature of the debugger. i do not know of any debuggers that do that, but you could write one.
0:34:26nij-Perhaps this is an XY problem. I want to let a lot of threads running in the background. But I find it annoying to have a debugger popping out everytime a condition is met.
0:34:35nij-Not sure if there's a better way than hacking the debugger..
0:42:44BikeCan you not jusst handle the conditions
0:42:56Bikefor example by logging the error and continuing?
0:43:11Bikehaving a debugger disappear while while i'm deciding what to do would probably just piss me off
2:48:46stylewarningwe just got pattern exhaustiveness checking in Coalton (:
2:48:57stylewarningit's sort of par for the course but it's a good achievement anyway
2:49:58hayleyBy doing really crappy compilation of the JSON output of the Coq Extraction module. I suspect Coalton would generate much better code (mostly around munging Lisp-1/2 and FFI'ing curried functions to Lisp uncurried functions).
2:50:40hayleyAs for why, because one course this semester involves "using static analysis tools" for cloud stuffs, for which they probably mean a linter.
2:51:48hayleyThen I had the terrible thought last night to feed verified code to CL. Not that my compiler is sound, or even close to working for anything other than ADD.