6 ms·
I guess that's the main problem. And look, defining a problem functionally works great on 10% of the cases, but it complicates some 40% of other cases (very im
by raverbashing 7y ago
I guess that's the main problem.
And look, defining a problem functionally works great on 10% of the cases, but it complicates some 40% of other cases (very imprecise numbers).
The world is not functional, as it turns out. And a lot of those cases where you can write functionally don't gain much from a performance or correctness perspective compared to the procedural version
- yakshaving_jgt 7y ago> The world is not functional What does this even mean? If the world is not functional, then what is it? Is the world procedural? And what world are we talking about? Our planet, physically? Are you then discounting the worlds of mathematics and logic? You don’t gain performance? What performance? Program execution speed? Development pace and time to market? Compared to the procedural version? Is your view that procedural programming is inherently better — for any definition of the word — regardless of context? Would SQL queries be easier to write if we told the query planner what to do? Is the entire field of logic programming — and by extension expert systems and AI — just a big waste of time? So many vague aphorisms which do nothing to further the debate. And Haskellers are the ones getting called “elitist”!
- raverbashing 7y agoIt'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
- deleted 7y ago[deleted]
- wott 7y ago>> The world is not functional > What does this even mean? If the world is not functional, then what is it? The world is full of special cases, of corner cases, of exceptions, of holes, of particular conditions, of differences for first or last element, and other irregularities; it is also full of sequential events. Applying a function to a starting set, to produce a resulting set or value is very lean with clean nice mathematical objects and relations, but not with many real-world problems. > And Haskellers are the ones getting called “elitist”! Well, one may say that answering with questions could fit the bill...
- tome 7y ago> The world is full of special cases, of corner cases, of exceptions, of holes, of particular conditions, of differences for first or last element, and other irregularities; it is also full of sequential events. True > Applying a function to a starting set, to produce a resulting set or value is very lean with clean nice mathematical objects and relations True > but not with many real-world problems. Debatable, but in any case a non-sequitur. Are you sure you're talking about functional languages as they're used in reality? I once wrote a translator between an absurdly messy XML schema called FpML (Financial products Markup Language) and a heterogeneous collection of custom data types with all sorts of "special cases, corner cases, exceptions, holes, etc.". I wrote it in Haskell. It was a perfect fit. https://en.wikipedia.org/wiki/FpML https://en.wikipedia.org/wiki/FpML
- yakshaving_jgt 7y ago> The world is full of special cases, of corner cases, of exceptions, of holes, of particular conditions, of differences for first or last element, and other irregularities; it is also full of sequential events. Yes. All of which are modelled in Haskell in a pretty straightforward manner. I’d argue Haskell models adversity like this better than most languages. > but not with many real-world problems. Haskell is a general purpose language. People use it to solve real world problems every day. I do. My colleagues do. A huge amount of people do. > Well, one may say that answering with questions could fit the bill... I see. So trying to define the terms to enable constructive discourse is elitist. Got it. If you want me to be more concrete and assertive, fine. No problem. Here we go. You are wrong.
- tome 7y ago> The world is not functional, as it turns out. Have you watched the talk "Are we there yet?" by Rich Hickey? He makes a convincing case, referencing the philosophy of Alfred North Whitehead, that "the world is functional". http://www.infoq.com/presentations/Are-We-There-Yet-Rich-Hickey http://www.infoq.com/presentations/Are-We-There-Yet-Rich-Hic...
- ukj 7y agoIn a functional world persistence (e.g memory) cannot be a thing. The case is convincing, but it requires you to reject your own, human, faculties. Makes the use/expression of language rather awkward when you can't remember any words.
- tome 7y agoThanks for your input, Euthyphro!
- ukj 7y agoMy knack for spotting performative contradictions didn't sway you towards Deskartes?
- kchamplewski 7y ago> In a functional world persistence (e.g memory) cannot be a thing. Why not? To give a functional Haskell flavoured example, I can use the Reader and Writer monads (which are functional) to create a whole bunch of operations which write to and read from a shared collection of data. That feels a lot like memory to me. Indeed, the Reader monad is defined as: > Computations which read values from a shared environment. I just don't understand the whole "you can't have memory / order of operations / persistence / whatever else" as an argument against functional concepts when they have been implemented in functional ways decades ago. The modern Haskell implementation of the writer monad is an implementation of 1995 paper. Edit: it looks like who I responded to doesn't actually want to have a reasonable discussion, but for anyone else reading along, it's entirely possible to have functional "state" or "memory" - what makes it functional is that the state / memory must be explicitly acknowledged. Trying do dismiss functional computation in this way is essentially a no true Scotsman; functional computation is useless because it can't do X (X being memory or persistence or whatever), but when someone presents a functional computation that does do X, it's somehow not a "real" functional computation precisely because it does X. Redefining functional computation as "something that can't do X" doesn't help anyone, and doesn't actually help with discussing the pros and cons of functional programming since you're not actually discussing functional computation but some inaccurate designed-to-be-useless definition mislabeled as functional computation.
- UK-Al05 7y agoyour just stating claims without any evidence.
- jbotz 7y agoActually, according to quantum physics, the world is functional. The Universe can be described by completely by a function (the universal wave function) and is completely time-reversible; you can run it forwards or backwards because it has no side-effects.
- boomlinde 7y agoThe collapse of a wave function into a single state that apparently happens on observation is as far as we know non-deterministic. The wave function itself is a probability amplitude. So I think it's a misinterpretation to say that "the universe can be described completely by a function" when everything we can actually know about the universe is observable and has necessarily collapsed from a probability amplitude of possible states into the observed state. My interpretation is the exact opposite. Newtonian physics suggests the fundamentally deterministic world that QM can't because in the latter the only thing that is deterministic is probabilities.
- jakeinspace 7y agoCollapse of a wave function occurs when one wave becomes entangled with another. If I shine a photon on a particle to measure it, and the particle emits a photon back to me, I am now entangled with that particle through mutual interaction. But to a distant observer, there is no wave collapse. If our universe is purely quantum and exists alone (not being bumped into by other universes), then its wave function would just be evolving unitarily according to it's Hermitian - totally deterministically (the wave function, that is).
- boomlinde 7y agoI don't know what it means for the universe to be "purely quantum", or what it means to be a "distant observer" yet somehow not interacting. A wave function in itself is not observable. Is it real? Definitional. Is it a physical phenomenon? Dubious. All we know is that as a model it is consistent with what we observe. What actually can be measured (and can reasonably be considered real and physical in that sense) can only be predicted probabilistically using quantum mechanics. It's like saying that I can perfectly predetermine the outcome of a dice roll—it's between one and six.