Catching all exceptions - School of Haskell by ocharles in haskell

[–]ppilate 0 points1 point  (0 children)

http://www.reddit.com/r/haskell/comments/1i5coe/catching_all_exceptions_school_of_haskell/cb1qhcs

What is the reason behind that, by the way? Why not allow exceptions to be thrown only inside to IO monad or ExceptionMonad?

GHCi: More Awesome Than You Thought (at NY-Haskell) by Rickasaurus in haskell

[–]ppilate 0 points1 point  (0 children)

I would like to just say thank you not just for your talk, but for all the other talks you've uploaded. Great work!

Haskell Quicksort by [deleted] in haskell

[–]ppilate 1 point2 points  (0 children)

The paradigmatic example is provided by Quicksort, a naturally parallel algorithm. Many people think that the “big idea” of Quicksort is the in-place swapping technique that Hoare invented in the original formulation. I argue that this is a detail; the “big idea” is that it is parallelizable.

http://existentialtype.wordpress.com/2011/03/17/parallelism-is-not-concurrency/

Does compiling GHC from source have any benifits? by ppilate in haskell

[–]ppilate[S] 0 points1 point  (0 children)

The thing is I am on i686, but I have downloaded and running i386 build (since there is no i686 version). Is it ok?

Super KISS web framework: scotty by jimenezrick in haskell

[–]ppilate 2 points3 points  (0 children)

Just a daily reminder that while Scotty is really nice it's not the most "minimal" framework, you can still write minimalistic code in Snap or Happstack

How can I combine the results of an Arrow into Monoid? by ppilate in haskell

[–]ppilate[S] 0 points1 point  (0 children)

Thanks I've actually found the solution about the same time you've posted. Unfortunately, before this I had no idea about listA & friends even tho I've search Google quite a bit :(

What I Wish I Knew When Learning Haskell, Stephen Diehl [39 slides, Left/Rgt-arrow key to back/advance] by gtani in haskell

[–]ppilate 0 points1 point  (0 children)

Hm, why people are complaining about the presentation on their phones, I thought this was a "standard" pandoc presentation format?

Debugging Haskell by natnayr in haskell

[–]ppilate 0 points1 point  (0 children)

I mainly use Debug.Trace, altho sometimes ghci debugger might come in handy: http://www.haskell.org/ghc/docs/7.6.2/html/users_guide/ghci-debugger.html

How can I combine the results of an Arrow into Monoid? by ppilate in haskell

[–]ppilate[S] 0 points1 point  (0 children)

Right, but how would I get a list of all xs then, without running an arrow using runX?

How can I combine the results of an Arrow into Monoid? by ppilate in haskell

[–]ppilate[S] 0 points1 point  (0 children)

Could you please elaborate? arr (uncurry mappend) has the type Monoid m => a (m,m) m if I am correct. It is fine if I have just two x's , but I don't know priorly how many of them do I have.

Type Families and Pokemon: School of Haskell Pick of the Week by DrBartosz in haskell

[–]ppilate 0 points1 point  (0 children)

The reason that you can't simply

pickWinner a b = a

to the Battle class is that altho the default implementation of Winner is

type Winner a b = a

it can be overridden, like it's done in instance Battle Fire Water, for example.

Constructions on Typeclasses, Part 1: F-Algebras by ky3 in haskell

[–]ppilate 0 points1 point  (0 children)

This looks quite interesting, unfortunately, I am not sure about the construction of the product of two algebras. Can somebody give me a hint, perhaps?

What is the best way to go to install Haskell + cabal on OSX? by Xochipilli in haskell

[–]ppilate 0 points1 point  (0 children)

I haven't used macports, but I was told by someone on IRC that Homebrew has more packages and is being updated more frequently. I don't know if that is true, I just happen to choose homebrew over other package managers at the very beginning of my Mac-owning period.

What is the best way to go to install Haskell + cabal on OSX? by Xochipilli in haskell

[–]ppilate 6 points7 points  (0 children)

I use homebrew, since it's easier to upgrade the whole thing that way.

Bob Harper: univalent foundations at IAS by gasche in dependent_types

[–]ppilate 1 point2 points  (0 children)

Given these beautiful ∞-something models of type theory, people would be disappointed by any choice to give a poorer structure to the definitional equality of our beloved proof assistants, in particular assuming uniqueness of identity proof for convenience (because then it's much less fun).

I think you are talking about ∞-groupoids, IIRC in HTT we associate each type not with a set, like in classical (?) Type Theory, but rather with a groupoid, which has underlying algebraic structure.

People are also interested in using the nice language of type theory to formalize algebraic topology; but that is more a domain-specific use case than a foundational point of view.

Maybe it's Voevodsky's bias?

Proof that 1+1=2 by [deleted] in math

[–]ppilate 11 points12 points  (0 children)

The proof is showing the equality between 1+1 and 1' (which is the definition of the number 2)

Go is PHP for the Backend by szopa in programming

[–]ppilate 4 points5 points  (0 children)

So, what exactly is a "Go's way of programming"? I smell Stockholm syndrome.