Rezultati pretraživanja
  1. 7. srp 2019.
  2. 7. ruj 2019.

    Time for some more abuse This time it's injecting preprocessing steps into generically derived Aeson FromJSON instances

  3. 22. srp 2019.
    Prikaži ovu nit
  4. 21. velj 2019.

    Someday I'll never again have to manually recurse over a data structure. And now that day is a little closer...

  5. 17. velj 2019.

    Found a pretty great way to define API instances together at once with ! Replaces either error-prone hand-written instances or annoying TemplateHaskell. Kudos et all for the feature and somebody on function prog Slack (I think @PttPrgrmmr) for the idea

    Prikaži ovu nit
  6. 12. stu 2019.

    newtypes are awesome because they reduce the pain of constantly making new semantically meaningful types rather than reuse a few primitives over and over Writing instances for them can bring the pain back though and GND doesn't always cut it is like a super power!

    Prikaži ovu nit
  7. 22. sij

    I made a combinator ¦ for that allows us to define combiantors deriving Arbitrary via VectorOf 3 a ¦ VectorOf 5 a ¦ VectorOf 11 a gives you a list instance that is restricted to those lengths

    Prikaži ovu nit
  8. 12. sij

    I'm collecting information for my thesis can you let me know if you have benefited from or :instances? () Thanks!

  9. 12. stu 2019.
    Odgovor korisniku/ci

    Hey if you are able/willing, could you link to some good resources on ?

  10. 11. sij

    help, apparently I can't do this? (GHC 8.6.5) > {-# LANGUAGE DerivingVia #-} > > data Test a = Zero | One a deriving Functor via Maybe

    Prikaži ovu nit
  11. 6. kol 2019.

    using really feels awesome, good bye boilerplate.

  12. 22. velj 2019.

    Finally got to try , and it worked beautifully, removing all uninteresting junk from my definitions: newtype Over m a = Over { getOver :: m } deriving (Functor, Applicative) via (Const m) Thanks and Ryan Scott!

    Prikaži ovu nit
  13. with we can write the derivation of Functor and Applicative from Monad once, and then use it for all data types, to save on boilerplate.

  14. 22. velj 2019.

    For people who don't know what is: It's a new extension of the Glasgow Haskell Compiler that can write a lot of boilerplate code for you, in surprisingly many situations. It's described in this Haskell Symposium 2018 paper: .

    Prikaži ovu nit
  15. 18. srp 2019.

    Hey is there a cheat how I can avoid repeating the datatype name in the via clause?

    Prikaži ovu nit
  16. 16. sij
    Odgovor korisniku/ci

    It is a misfeature in my opinion, as we developed we and we all agreed that it should not have existed (or at least, if it existed it should have some way of prioritizing different deriving)

  17. 23. kol 2019.

    For some reason I can't deriving Traversable via Either a

  18. 16. lip 2019.

    Reading the paper by , thinking “hm yes this is all very nice and sensible” – reach §2.1 Composition, “This works because Duration still shares the same runtime representation as NonNegative (Large Int)” 🤯 *nice.*

  19. 3. tra 2019.
    Odgovor korisniku/ci

    I guess what I'd like to emphasise is the local nature of this instance derivation compared to , so perhaps -XDerivingLocalVia. This reminds me of -XDictionaryApplications proposed in this Haskell Symposium 2018 paper by Winant and Devriese: .

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.