3 ms·
It's not vague, processors are still procedural. Network, disk, terminals, they all have side effects. Memory and disk are limited. SQL queries are exactly one
by raverbashing 7y ago
It's not vague, processors are still procedural. Network, disk, terminals, they all have side effects. Memory and disk are limited.
SQL queries are exactly one of those cases where functional expression of a problem outperforms the procedural expression, and that's why they're used where it matters.
- yakshaving_jgt 7y agoAre you suggesting functional programming is somehow so resource intensive that it is impractical to use? Or that functional programming makes effectful work impractical? Because neither of those are true. You’ve conceded that SQL queries are one case where a functional approach is more ergonomic (after first asserting that the world is not functional, whatever that means). Why aren’t there other cases? Are you sure there aren’t other cases? One could argue that a functional approach maps more practically and ergonomically for the majority of general programming work than other mainstream approach.
- raverbashing 7y ago> Are you suggesting functional programming is somehow so resource intensive that it is impractical to use? Or that functional programming makes effectful work impractical? Because neither of those are true. No, I'm saying the functional abstraction doesn't work or is clunky in a lot of cases and that Haskell's approach of making it the core of the language is misguided (Lisp is less opinionated than Haskell for one). > One could argue that a functional approach maps more practically and ergonomically for the majority of general programming work than other mainstream approach. They could argue, but they would be wrong. SQL works because it's a strict abstraction on a very defined problem. Functional is great when all you're thinking about is numbers or data structures. But throw in some form of IO or even random numbers and you have to leave the magical functional world. And you know why SQL works so fine? Because there are a lot of people working hard in C/C++ doing kernel and low-level work so that the "magic" is not lost on the higher level abstractions. And can you work without a GC?
- yakshaving_jgt 7y ago> I'm saying the functional abstraction doesn't work or is clunky in a lot of cases and that Haskell's approach of making it the core of the language is misguided Functional programming certainly doesn't work literally everywhere, but to say Haskell's design is "misguided" is your opinion, and it's one that some of the biggest names in the industry reject. How much experience do you have designing programming languages? Or even just building non-trivial systems in Haskell? Judging by the evident ignorance masked with strong opinions I'd say around about the square root of diddly-nothing. > But throw in some form of IO or even random numbers and you have to leave the magical functional world. Wrong. Functional programming handles IO and randomness just fine. > And you know why SQL works so fine? Because there are a lot of people working hard in C/C++ doing kernel and low-level work so that the "magic" is not lost on the higher level abstractions Are you suggesting there aren't a lot of people working hard on GHC? Because if you are — and you seem to be — then again you would be wrong.
- deleted 7y ago[deleted]
- ukj 7y agoThis 1000 times. The reason SQL (really - relational algebra) works so well is precisely because relational data is strongly normalized [1]. But the data is only a model of reality, not reality itself. And when your immutable model of reality needs to be updated strong normalisation is a curse, not a blessing. The data structure is the code structure in a strongly-typed system[2] Strong normalisation makes change very expensive. [1] https://en.wikipedia.org/wiki/Normalization_property_(abstract_rewriting) https://en.wikipedia.org/wiki/Normalization_property_(abstra... [2] https://en.wikipedia.org/wiki/Code_as_data https://en.wikipedia.org/wiki/Code_as_data
- tome 7y ago> processors are still procedural Exactly. I don't know why Haskell fanboys insist on abstracting us so far from the machine. Declarative programming is really unhelpful because it says nothing about the order in which code executes. We live in a mutable physical universe that corresponds to a procedural program. One thing happens after another according to the laws of physics (which are the procedural program for our universe). Electrons move one after another around circuits. Instructions in the CPU happen one after another according to the procedural machine code. The universe would never consider running 2020 before 2019 and a CPU will never execute later instructions before earlier instructions. Haskell fanboys talk about immutable data structures like it's beneficial to go back in time and try again. But it's a bad fit for the CPU. The CPU would never run some code and then decide it wants to go back and have another go.
- vkou 7y ago> The universe would never consider running 2020 before 2019 and a CPU will never execute later instructions before earlier instructions. Except thanks to a compile-time optimization.
- gugagore 7y agoAnd ooo-execution that happens at _runtime_.
- Schoolmeister 7y ago> Exactly. I don't know why Haskell fanboys insist on abstracting us so far from the machine. I believe it is because abstractions are the way we have always made progress. Is the C code that's so close to the machine not just an abstraction of the underlying assembly, which is an abstraction of the micro operations of your particular processor, which in turn is an abstraction of the gate operations? The abstractions allow us to offload a significant part of mental task. Imagine trying to write an HTML web page in C. Sure it's doable with a lot of effort, but is it as simple as writing it using abstractions such as the DOM? > We live in a mutable physical universe that corresponds to a procedural program. One thing happens after another according to the laws of physics (which are the procedural program for our universe). You just proved why abstractions are useful. "One thing happens after another" is simply our abstraction of what actually happens, as demonstrated by e.g. the quantum eraser experiment [1][2]. [1] https://en.wikipedia.org/wiki/Delayed-choice_quantum_eraser https://en.wikipedia.org/wiki/Delayed-choice_quantum_eraser [2] https://www.youtube.com/watch?v=8ORLN_KwAgs https://www.youtube.com/watch?v=8ORLN_KwAgs