Een belangrijke overweging van mij is dat de partij groot genoeg is om echt het verschil te maken. Daarom ben ik recent lid geworden van Groenlinks. Ik denk dat Groenlinks-PvdA de enige fractie is die groot genoeg en ook duidelijk pro-europa is.
That's is how things used to work here in the Netherlands, until the EU forced us to change our laws in 2014:
Haskell Interlude Podcast 62 - Conal Elliott
In this episode Wouter Swiestra and Niki Vazou talk with Conal Elliott. Conal discusses doing things just for the poetry, how most programs miss their purpose, and the simplest way to ask a question. Conal is currently working on a book about his ideas and actively looking for partners.
In this episode we'll discuss the the four different ways GHC offers for deriving class instance definitions: the classic 'stock' deriving, generalised 'newtype' deriving, as well as the 'anyclass' and 'via' strategies. For each of these, we'll explain the underlying ideas, use cases, and limitation...
Overview of our recent work to re-think the Cabal architecture
Haskell Interlude 61: Sam Lindley
Sam Lindley is a Reader in Programming Languages Design and Implementation at the University of Edinburgh. In this episode, he tells us how difficult naming is, the different kinds of effect systems and handlers, languages much purer than Haskell, and Modal logic.
Why? They immediately explain that the difference in performance would not be significant on such a small problem and I see no other reason to prefer arrays over maps.
Thanks, I did look at the Wikipedia page, but the Applications section is pretty difficult to read. The applications it lists are themselves quite abstract problems.
Also, I think the 'find' operation could be replaced by an operation that checks if two elements are in the same set. That way you don't have to come up with a "name".
One thing I'm missing is which problems this technique can solve. I believe one important use case is in type inference. Are there many other problems that can be solved by union-find?