3 ms·
> Leibniz's rule > x=y => f(x)=f(y) Eh, it's useful in some cases, especially from a theoretical perspective, but... x = 0.0 y = -0.0 f = \x(copysi
by a1369209993 5y ago
> Leibniz's rule
> x=y => f(x)=f(y)
Eh, it's useful in some cases, especially from a theoretical perspective, but...
x = 0.0
y = -0.0
f = \x(copysign(1,x))
x = "foo"
y = "f"+"o"+"o"
f = debug.dump-pointer
...pragmatically I'm not interested in a programming language where it does hold. It prohibits too many important utility functions.
- User23 5y agoYou’re not even wrong. I suggest that you at least take the five minutes to read the wikipedia summary on predicate transformers before posting a replying in which you observably have no idea what you’re talking about. Briefly, predicate transformers are functions about the behavior of a language, not functions in the language. In that model predicates are pure functions over the program state space and predicate transformers are functions from predicates to predicates. Clearly your objections are inapplicable.