libera/#lisp - IRC Chatlog
Search
14:04:25
contrapunctus
oh, so there are even moar - https://github.com/quil-lang/cmu-infix https://github.com/mrcdr/polisher
14:05:44
moon-child
ACTION wonders if there are more infix-syntax reader macros or computer algebra systems
14:51:46
yitzi
Maxima is obviously a notebook kind of interface. Difficult to call from inside CL, generally. Weyl is an algebra substrate inside CL. https://github.com/OdonataResearchLLC/weyl
14:58:16
moon-child
ok. I would consider both of those cas. Particularly in context: the point is that everybody and their brother has built symbolic mathematical analyzers in lisp
15:00:22
yitzi
Yeah, I would like to see more fresh attempts at things like Weyl, i.e. doing CAS inside CL without trying to create a whole new algol style interpreter.
15:02:10
moon-child
I mean, the underlying representation should be very different. Regardless of whether your interface to that representation uses lisp syntax or not
15:02:30
moon-child
I mean--you still need a first-class representation of logic and control flow, if you wish to abstract over it
15:03:04
contrapunctus
Is there any downside to making 'one-off' methods, i.e. those which only apply to one class, as a shorthand for a function which only makes sense for a specific class? They wouldn't make sense as part of a generic protocol, so it seems like a bit of an inelegant hack...
15:03:08
moon-child
so, sure, it's a bit nice to be able to point at an opaque lisp function, but it doesn't buy you _much_. And you may have cas-language<->lisp ffi anyway
15:07:13
yitzi
moon-child: I am not sure about that. I meant just that I grown to dislike the attempts to create new programming language with its own control flow, logic, etc inside a notebook style language. The languages like Maxima/Axiom end up being flawed and very limited, IMHO. Instead I would like to see more attempts to embed the CAS in completely functional language like CL. Not sure how clear I am being. ;)
15:09:06
moon-child
you will need a new programming language. Common lisp does not represent its functions symbolically. CAS are all about manipulating functions symbolically
15:09:54
moon-child
...unless you wish to implement _all of cl_ in a cas. But that would not be a very capable cas; it would not be able to make many substitutions for fear of mutation
15:13:15
yitzi
Its ok. I have used both Mathematica and Maple extensively, so I wasn't trying to bring up Maxima as the lone example. And to be fair I am not thinking of something as exhaustive as Axiom.
17:48:43
sveit_
hi. how do I make inheritance work with generic metaclasses? In particular, make children inherit the metaclass? More specifically, the following gives me an error in sbcl:
17:49:04
sveit_
(defclass a () () (:metaclass closer-mop:funcallable-standard-class)) (defclass b (a) ()) (make-instance 'b)
17:49:46
sveit_
I can fix this particular error with (defclass b (a) () (:metaclass closer-mop:funcallable-standard-class)), but I'd rather inheritance of the metaclass be "automatic"
17:50:24
phoe
https://github.com/phoe-trash/value-semantics-utils/blob/main/src/always-bound-class.lisp
17:52:12
sveit_
phoe: will do, thanks! I am actually confused why I am getting the error in the code I wrote according to my understanding of the MOP