Ah, we agree then maybe. An implementation isn’t necessarily exposed, but you’re asking it to (a) use combinators (b) expose them (c) allow defining new primitive combinators instead of hiding, say, that a parser is a function of a certain type. That’s what pure embedding means!
-
I accept John's points 1. and 3. as self-evident. From a user's perspective, why should I care about 2.? Probably because it manifests as something I care about. What is that something and what's the causal link from orthogonality to that something.
What if a function says, "this is a really nice and friendly function!" and then you look at the type and it looks hunky dory? Then bam, it goes into production and calls List#head Now you have a clusterfuck on your hands.
-
-
This is covered by John's point 1.
-
I agree, but how do you measure it? Can it be called with null? Are you sure?
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.