freenode/#lisp - IRC Chatlog
Search
22:43:15
aeth
The future of programming is source code that compiles one of two things depending on whether or not the human at the computer managed to win a game of chess at compile time.
22:43:41
jmercouris
(defun make-thread (bt:make-thread (lambda () (make-thread)))) (eval-when (:compile-toplevel) (make-thread)) ; do you want to play a game?
0:58:59
skeuomorf
PuercoPop: Is there a way to get the generated page title in coleslaw to be == post title?
1:02:31
grand-beginner-t
I've been pondering lisp OS's (and smalltalk/forth, et al.). I suppose the biggest issue in writing one would be the drivers and interrupt mechanics (maybe GC doesn't mix too well with these things, I'm not qualified to make an assertion). Any thoughts or comments? Thought it might be an interesting discussion.
1:03:31
Fare
With a proper type system (see also prescheme), you can write the low-level parts in Lisp.
1:05:06
skeuomorf
grand-beginner-t: I remember hearing Gerry Sussman a while back complaining explicitly about writing drivers in functional languages and how much of a challenge it is :)
1:05:21
grand-beginner-t
I understand that a DSL could be written that acts similarly to C or Rust, but I'm referring to the nature of the OS itself - being object-based and similar to a smalltalk environment
1:07:53
grand-beginner-t
I think my question (and the direction of my thought) may not actually make proper sense.
1:07:58
skeuomorf
Hey jackdaniel, do you happen to know if there is a way to get the generated page title in Coleslaw to be == post title?
1:11:05
eschatologist
grand-beginner-t: if you’re thinking about Lisp operating systems, first look at Mezzano and read the Symbolics Genera and TI Explorer documentation
1:11:46
eschatologist
You can also read the code for Smalltalk-80 and its successors, which run on a variety of hardware.
1:12:47
eschatologist
Oh no, there has to be some wiring of memory and locking of accesses in drivers, just like in every operating system!
1:14:42
grand-beginner-t
This isn't entirely lisp oriented but has anyone read of COS? It's an object system with dynamic, multiple dispatch copying CLOS but for C.
1:18:27
skeuomorf
When using slime, it keeps idling show me "error in process filter: wrong number of arguments: (0 . 1), 2" in the minibuffer then continuing to work repeatedly, what's up with that?
1:20:21
White_Flame
the emacs-loaded slime code and the lisp-loaded swank server can get out of date with each other depending on what you update when
1:26:35
skeuomorf
Bike: It doesn't error out, it's just a message that appears in the minibuffer while causing slime to idle for a bit
1:27:07
Bike
yeah, it should just print a backtrace and stuff when the error's signaled, even if it's handled later
1:32:14
skeuomorf
Bike: Well, I tried, I enabled `slime-toggle-debug-on-swank-error`, didn't do anything
2:08:51
fiddlerwoaroof
Are you using emacs 26? some of emacs's apis changed and the relevant slime changes are not released yet.
4:53:34
epony
And, most wonderful sunrises these days here too with a full moon on the opposite side of the sky at the same time..
6:49:42
merskiasa
Anyone here able to write an IRC bot like this: http://www.omnimaga.org/computer-projects-and-ideas/haroldbot-%28theorem-prover-solver%29
6:55:47
merskiasa
The thing has four modes: 1) solve, 2) quantified solve, 3) calculation and 4) prove.
6:56:10
merskiasa
1) solve and 4) prove are basically identical, because they differ only in predicate to prove (equality for solve and arbitrary comparison for prove). Prove needs a way to interpret results
6:56:35
merskiasa
I know how to formulate problem in CNF/BDD form. I also know how to use SAT solver. I haven't implemented interpretation of unsatisfability results.
8:19:24
shka_
beach: busy with my own stuff, but merskiasa didn't even said what the heck he is doing
9:04:02
p_l
no, no, you see, the symbol had to fit in 36bits, so case is irrelevant but only 6 letters ;)
9:08:36
shrdlu68
TMA: Apparently they had a choice on that one: https://en.wikiquote.org/wiki/Ken_Thompson
9:14:40
merskiasa
<merskiasa> Anyone here able to write an IRC bot like this: http://www.omnimaga.org/computer-projects-and-ideas/haroldbot-%28theorem-prover-solver%29
9:14:48
merskiasa
<merskiasa> The thing has four modes: 1) solve, 2) quantified solve, 3) calculation and 4) prove.
9:14:49
merskiasa
<merskiasa> 1) solve and 4) prove are basically identical, because they differ only in predicate to prove (equality for solve and arbitrary comparison for prove). Prove needs a way to interpret results
9:14:49
merskiasa
<merskiasa> I know how to formulate problem in CNF/BDD form. I also know how to use SAT solver. I haven't implemented interpretation of unsatisfability results.
9:42:05
shka_
it is rather messy and if i would have more time i would write my own (with thread safety and perhaps even parallel unification built in) but it should be enough for you
9:56:21
shka_
when i attempt to load with quicklisp (which just calls asdf i think) it won't load because of unkown class
9:58:07
lieven
yeah the last sentence of LOCALLY says: If a locally form is a top level form, the body forms are also processed as top level forms.
10:00:30
lieven
defclass is used as an example in the ISSUE about locally and I see no reason why it shouldn't work