3 ms·
Now you're talking about an infinite complexity. It cannot be reduced no matter how hard you try. It has nothing to do with the kind of complexity that software
by sklogic 10y ago
Now you're talking about an infinite complexity. It cannot be reduced no matter how hard you try. It has nothing to do with the kind of complexity that software engineering have to deal with.
But, for all things practical, yes, it's just a handful of Lisp macros. Because in most cases it worth designing your DSLs as total languages, and totality proof is totally trivial, as well as a proof of an opposite.
- dunkelheit 10y agoNow that's moving the goal posts. You then claim that I am nitpicking and Lisp eliminates not all complexity but only the complexity software engineers care about (not true either: even Lisp programs don't write themselves and someone still has to type in the letters). After that the conversation moves into wishy-washy domain of opinions which can be debated forever without ever reconciling them.
- sklogic 10y agoPay attention to what you're answering to. It was you who moved the goal posts. > there are well known techniques for eliminating any complexity you can find in a chain of compiler transforms, Can you imagine finding a working termination proof in a compiler pipeline and finding yourself in a dire need of simplifying this complexity down to something manageable?
- dunkelheit 10y agovitaly is that you?
- sklogic 10y agoIs it a problem? Is it even relevant at all?
- dunkelheit 10y agoWell, sorry for shying away from technical discussion and mildly doxing you. But it is truly remarkable that your style remains recognizable across decades, languages, nicknames and discussion forums. I am actually honored to have a small discussion with you :) Hope you are well.