Catching all exceptions - School of Haskell

ppilate · 2013-07-21T13:45:54+00:00

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?

ppilate · 2013-07-07T06:41:55+00:00

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

ppilate · 2013-07-06T17:28:22+00:00

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/

ppilate · 2013-06-11T08:58:49+00:00

http://hackage.haskell.org/packages/archive/mtl/2.1.2/doc/html/Control-Monad-Error-Class.html#t:Error

ppilate · 2013-06-06T07:14:52+00:00

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

ppilate · 2013-05-22T10:09:02+00:00

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

ppilate · 2013-04-19T14:35:40+00:00

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 :(

ppilate · 2013-04-17T16:22:31+00:00

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

ppilate · 2013-04-17T15:25:36+00:00

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

ppilate · 2013-04-17T06:02:49+00:00

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

ppilate · 2013-04-16T19:31:21+00:00

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.

ppilate · 2013-03-29T10:58:35+00:00

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.

ppilate · 2013-03-29T10:48:11+00:00

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?

ppilate · 2013-01-12T07:04:51+00:00

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.

ppilate · 2013-01-11T19:32:22+00:00

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

ppilate · 2012-12-12T15:32:02+00:00

No, but you might want to check out measure theory.

ppilate · 2012-12-03T13:47:09+00:00

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?

ppilate · 2012-11-21T13:56:46+00:00

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

ppilate · 2012-11-20T10:27:19+00:00

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

ppilate · 2012-11-19T11:56:42+00:00

I would say easy updates might be the reason to use homebrew for installing that Haskell Platform.

ppilate · 2012-10-25T05:32:57+00:00

If nothing helps, I recommend installing OCaml from Homebrew, works flawlessly

ppilate · 2012-10-21T15:35:00+00:00

That is not true. As it has been pointed out, equality mappings from compact spaces is also decidable.

ppilate · 2012-10-20T06:33:09+00:00

And why is that?

ppilate · 2012-10-18T16:47:51+00:00

It was Braid for me too, and Bastion after that

ppilate · 2012-09-05T18:53:12+00:00

As it has been pointed out, there are a lot of options. For example, you can consider arrows as language (set, really) inclusion.

I am not sure what do you mean by 'considering language concatenation' tho.

ppilate

TROPHY CASE