5 ms·
> Except that I have told you repeatedly that not only am I aware of this. EVERYONE is aware of this. Why are you repeating this same concept over and over agai
by yellowapple 7y ago
> Except that I have told you repeatedly that not only am I aware of this. EVERYONE is aware of this. Why are you repeating this same concept over and over again.
Because you seem to continue to think that procedural composition is impossible even though it's literally the thing that allows functional composition to exist on actual physical computers. That you continue to deny this suggests that somehow you are not in the category "everyone".
> You are bending the system to imitate functions.
s/bending/using/ s/imitate/implement/
Again: procedural composition is a dependency of functional composition as soon as you move from theory to practice. That's what you don't seem to be getting.
You're right that my points are indeed plainly obvious, which makes it all the more interesting that you continue to deny them. It's not a revelation for me at all; it's basic computer science, and you seem to have drank so much of the FP Kool-Aid to have forgotten how computers actually work.
> Do you know lambda calculus? Where are the numbers in that?
Trying to cite some purely-theoretical concept as "proof" that an actual working system can operate without numbers is not proof at all.
> The fact that Int exists is abstraction leakage from the lower levels of the computer.
You call that "leakage", I call that "making it actually useful in the real world". A function is meaningless unless it has something to, you know, actually operate upon.
> Imperative procedures do not compose unless you bend them to compose.
Yes, because executing one thing after the other is "bending". /s
That's - again - literally all that's necessary to compose procedures, because - again - whether or not they should be composed is different from whether or not they can be composed. The composition may be unclean, but it is still composition.
----
Since we're at the "let's throw wikis at each other" phase of this discussion, here's some reading material for object composition, which you still for some reason deny is possible despite there being plentiful theoretical and practical demonstrations thereof: https://en.wikipedia.org/wiki/Object_composition https://en.wikipedia.org/wiki/Object_composition
Object composition - via aggregation - is also a very widespread concept prevalent even in non-object-oriented languages, including functional languages (tuples are the composition of internal objects, and can be universally composed; cons cells in Lisp (and lists in e.g. Erlang) are the composition of other cons cells and/or NIL, and can be universally composed; etc.).
To correct myself a bit, inheritance is not in and of itself composition, though it may be combined with aggregation to make a composed object more useful.
- crimsonalucard 7y ago>Because you seem to continue to think that procedural composition is impossible even though it's literally the thing that allows functional composition to exist on actual physical computers. That you continue to deny this suggests that somehow you are not in the category "everyone". It allows it to exist in computers because that is the type of machine that we've physically built. Theoretically, functions and procedures exist side by side one is not better than the other. Composition exists in computers not at the primitive instruction set level. It exists as a higher order operation that occurs as a phenomenon when lower level procedures are executed in a certain order. There is no compose procedure that exists in assembly language. >Again: procedural composition is a dependency of functional composition as soon as you move from theory to practice. That's what you don't seem to be getting. No you don't get it. In theoretical computer science both functions and procedures exist side by side neither depends on the other but in theory we can construct both concepts with functional or procedures as the basis. It is because we happened to invest a lot of research in building physical machines that are procedural that makes this a dependency in physical machines. It is NOT a DEPENDENCY in COMPUTER SCIENCE. > and you seem to have drank so much of the FP Kool-Aid to have forgotten how computers actually work. I seem so? Then why am i describing everything from the instruction set level and up. I know how it all works. both in theory and physically. You seem to be lacking the theoretical and mathematical basis. You claim to work in the real world yet you keep talking about composing useless things together without context. >Trying to cite some purely-theoretical concept as "proof" that an actual working system can operate without numbers is not proof at all. Did I not tell you to check out the Nat type in Haskell, Idris or Coq? This is not only theoretical it can be on a physical computer and actually is used for dependently typed languages. >You call that "leakage", I call that "making it actually useful in the real world". A function is meaningless unless it has something to, you know, actually operate upon. Right and when did I say a function isn't doing anything in the real world. You can do real world calculations on a real world computer with functions all the way down. Get it? >Yes, because executing one thing after the other is "bending". /s Executing one thing after another is not composition. Composition requires something to be combined with another. >whether or not they should be composed is different from whether or not they can be composed. The canonical definition not the hand wavy one that spans across arbitrary languages defines composition as something that can only be composed if they should be composed via the type system. --- I defined the composition definition at the beginning of this topic. I have told you repeatedly to stick with it. Object composition as defined by anyone is hand wavy.