Maintaining haskell programs

[hellwolf]

The remaining question to be nitpicking would be… would they generate the exact same code?

[hellwolf]

exampleLet2' = (,)
           do let x = 3 in x+x
           do 10 * 5

?

[hellwolf]

@maxigit

Basicall do acts as a $ until the end of the line

Multiline-lambda without brackets was what I used blockarguments for though.

Edit:

Added an example:

exampleLet2' = (,)
            do \(me, a, favor) ->
                favor a me
            do 10 * 5

[atravers]

Another potential “hairball” :

• GADTs, Functoriality, Parametricity: Pick Two

  The main result of this paper shows that the choice of representation of data types in a language supporting GADTs determines whether or not that language can have parametric models. It thus determines whether or not GADTs can enjoy consequences of parametricity such as representation independence, equivalences between programs, deep induction principles, and useful (“free”) theorems about programs derived from their types alone. This result is unintuitive, novel, and surprising.

[mchav]

Have read the books. I do wish though there were more “projects” and exercises. I find that’s ideas make sense when I read them but as I went I found myself having to constantly reread parts.