wz1000

49 ms·

421.
by wz1000 12y ago
(.:) f g = (f .) . g This can interestingly be generalized(in a way) to get (.::) :: (d -> e) -> (a -> b -> c -> d) -> a -> b -> c -> d (.::) f g = ((f .) .) . g and so on. Since fmap = (.),
422.
by wz1000 12y ago
Just before the electricity goes, an electromagnetic disturbance or a shockwave causes the CPU to skip a few instructions, printing out the answer.
423.
by wz1000 12y ago
It's also pretty extensible and integrates with KDE Connect very well.
424.
by wz1000 12y ago
KDE apps can look very pretty if you find the right colorscheme, icon theme and widget style. I love the sheer amount of customizability and options KDE offers. I recommend Flattr icons[0] and the Hex QtCurve Style[1] [0]: http:/&#x2F
425.
by wz1000 12y ago
> Taptic engine > Force Touch trackpad I'm annoyed by senseless techno-marketing jargon.
426.
by wz1000 12y ago
I don't really use anything in production, I am just a learner right now :) There are some people using some of extensions for Haskell inspired by "dependently typed" systems in production. Dependent typing is an active resea
427.
by wz1000 12y ago
I agree with most of what you said, but > Lastly, types only give you a single dimension of safety. Dependent types can express a huge number of things, and are often limited only by your ability to describe what exactly you want.
428.
by wz1000 12y ago
You are right. I had heard of corecursion before but never thought of it in this context. Thanks to your comment I feel like I have finally groked it :)
429.
by wz1000 12y ago
Hell and Shelly are based on a similar concept, but also try to use the power of the Haskell type system to prevent common errors and bugs. [0]: https://github.com/chrisdone/hell [1]: https://github.com&#x2F
430.
by wz1000 12y ago
I'm just nitpicking here, but > Recursive functions that don't test for a base condition Base conditions are not necessary in lazy languages. Example in Haskell: fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
431.
by wz1000 12y ago
Coq[0] provides functionality that is an extension of this concept. It checks your proofs for you! [0]- https://coq.inria.fr/
432.
by wz1000 12y ago
Interesting. The psychedilic and nootropics culture could also be described as having "Hacking the brain" as one of its essences.
433.
by wz1000 12y ago
http://www.buildyourownlisp.com/
434.
by wz1000 12y ago
I don't see anything wrong with the font rendering on that.
435.
by wz1000 12y ago
Or you can require the gateway to be formally verified, running something like this[0] Of course, then you have to construct a spec which is foolproof. [0]- http://www.ok-labs.com/_assets/image_library/NICTA-Techni
436.
by wz1000 12y ago
You misunderstand. IO is just as much a purely functional concept as the rest of the language. notPurelyFunctional is a purely functional function. "notPurelyFunctional 5.0" will behave the same way no matter what you do with
437.
by wz1000 12y ago
Haskell with an FRP library may work for what you want to do. Reactive-banana looks good, though I haven't used it.
438.
by wz1000 12y ago
I think emacs is as close we are going to get to a Lisp Machine today.
439.
by wz1000 12y ago
Well, if you want to take minimalism to the extreme, there is surf[0] [0]- http://surf.suckless.org/
440.
by wz1000 12y ago
The 'do' is superfluous. It would be much better as main = let greet name = putStrLn ("Hello, " ++ name) in getLine >>= greet
441.
by wz1000 12y ago
That depends on how you define Additive, whether it includes the concept of commutativity, associativity and so on.
442.
by wz1000 12y ago
You are not getting my point. He is saying that something (which is kind of like a container or context for values, but even this is a false analogy) behaves like a monad (lets call the monad M) if and only if functions that take some value
443.
by wz1000 12y ago
> You're defining a monad by using itself in the definition! A definition is recursive if it recurses. The parent is not defining a monad with that sentence, he is defining what a monadic function is given that you have something th
444.
by wz1000 12y ago
Please don't use the word functor to refer to C++ function objects. It already has a well defined and widely used meaning in mathematics and computer science which bears almost no resemblance to its C++ counterpart.
445.
by wz1000 12y ago
2 24" monitors running Arch Linux with xmonad as my window manager on a custom built PC with a Haswell i5, 16GB ram and a 750Ti.
446.
by wz1000 12y ago
Bitcoin may suit your needs.
447.
by wz1000 12y ago
Really cool, but I am assuming printf only works for values which are determined at compile time?
448.
by wz1000 12y ago
Yes, one thing I would like to see in Haskell is more monads based on IO, but specialized to deal with specific kinds of side effects. An example of this(not a very good one I'm afraid) is the X monad.
449.
by wz1000 12y ago
Have you read Lockharts Lament[0]? It discusses something similar to what you have experienced. [0]- https://www.maa.org/external_archive/devlin/LockhartsLament....
450.
by wz1000 12y ago
Would writing your xmonad.hs count as configuring someone elses software, or creating your own?

More ›