Curry Club Augsburg

@curry_club_aux

Typen, Effekte, Laziness und indisches Essen // Eine Monade ist ein Monoid in der Kategorie der Endofunktoren

Vrijeme pridruživanja: listopad 2015.

Tweetovi

Blokirali ste korisnika/cu @curry_club_aux

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @curry_club_aux

  1. proslijedio/la je Tweet
    16. pro 2019.

    Fünfter großer Haskell-Workshop des Curry Clubs Augsburg am 21. Dezember 2019 im

    Poništi
  2. proslijedio/la je Tweet
    3. pro 2019.

    Part II der Vortragsreihe zum Thema Nachhaltigkeit: Ernährung und Nahrungsmittelerzeugung! Diesen Freitag um 19:00 Uhr im Lab. Bitte kurz ankündigen, wenn ihr vorbei schauen wollt!

    Poništi
  3. proslijedio/la je Tweet
    24. lis 2019.

    Munich Lambda Meetup. Introduction to Theorem Proving with Isabelle/HOL

    Poništi
  4. proslijedio/la je Tweet
    11. lis 2019.

    Ormolu: a new approach to formatting Haskell goes from vapourware to beta release. Check out the blog post that explains it all!

    Poništi
  5. proslijedio/la je Tweet
    5. lis 2019.

    Hello World! Es tut sich was im Lab, schaut doch mal auf unserem Blog () und Terminkalender () vorbei, und erfahrt, was in nächster Zeit so ansteht! Stay tuned for more events to come...

    Poništi
  6. proslijedio/la je Tweet
    2. lis 2019.

    New book: Haskell from the Very Beginning

    Poništi
  7. proslijedio/la je Tweet
    28. ruj 2019.

    Saw this just now: "The two lists should be the same length. If they are not, an exception is thrown." There's a better way. Instead of asking for two lists, ask for one list of tuples. Then you're guaranteed that the precondition is checked at the call site.

    Poništi
  8. proslijedio/la je Tweet

    Today I woke up and realized the company that built the apartments next door left hundreds of visual proofs that (a+b)² = a²+2ab+b² hidden on the windows!

    Poništi
  9. proslijedio/la je Tweet
    22. ruj 2019.

    Dhall assertions can compare arbitrary expressions, even functions, and you get a syntactic diff if the function comparison fails

    Comparison of sum and product functions
    Poništi
  10. proslijedio/la je Tweet
    Odgovor korisnicima i sljedećem broju korisnika:

    P is for Prelude, partial and problematic Q is for Data.Queue, for ordering automatic

    Poništi
  11. proslijedio/la je Tweet
    16. ruj 2019.

    We are hiring for a Haskell/PureScript position at KSF Media in Helsinki! 🎉🎉 Full details here: I have open DMs so feel free to send questions over, and please RT for visibility 😊

    Poništi
  12. proslijedio/la je Tweet
    12. ruj 2019.

    Version 1.26.0 of the Haskell implementation of Dhall is out: ☑ Standard version 10.0.0 ☑ `dhall format` preserves `let`-related comments! ☑ Marshal recursive Dhall types into Haskell ⚠️ Some performance regressions (Fix in progress) For more details:

    Poništi
  13. proslijedio/la je Tweet
    12. ruj 2019.

    2019 and we already have a robust dependently typed total/normalizing configuration language with first class modules :O

    Poništi
  14. proslijedio/la je Tweet

    Today, I published my first library on Hackage. I wanna thank for all his tireless help, and answers to all my (oddly-phrased and timed) questions, without which this would not have been possible.

    Poništi
  15. proslijedio/la je Tweet
    7. ruj 2019.

    MuniHac 2019 keynotes are/will be at The first two keynotes by and are already available.

    Poništi
  16. proslijedio/la je Tweet

    tl;dr strong typing lets you move a lot of the knowledge about the structure of a program from your brain to the code/compiler. weak typing lets you do crazy shit but you have to keep the invariants in mind at all times - and I'm not smart enough to do that.

    Prikaži ovu nit
    Poništi
  17. proslijedio/la je Tweet

    I don't dislike weak typing because I'm smart btw I dislike weak typing because I'm dumb, and I make lots of mistakes, and I would like some help - please, oh god help - catching them as soon as possible

    Prikaži ovu nit
    Poništi
  18. proslijedio/la je Tweet
    26. kol 2019.

    A very general method of computing shortest paths. ~ Russell O’Connor.

    Poništi
  19. proslijedio/la je Tweet
    15. kol 2019.

    If I give another talk, I wanna make it about dispelling the myth that type systems and compilers constrain your creativity and prevent tinkering and force you down some narrow path My compiler is *what lets me* play fast and loose and try different ideas with fast feedback!

    Poništi
  20. proslijedio/la je Tweet
    15. kol 2019.

    Do you like ❄️ Nix? 🦀 Rust? Interested working on my team at ? I'm looking for: 👩‍🔬 Senior Engineer 🗺️ Remote (or 🗼 Paris based) 🕓 TZ compatible with eastern US & western/central EU Email me with your resume/CV: graham.christensen@tweag.io

    Poništi

Č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.

    Možda bi vam se svidjelo i ovo:

    ·