A64m_qb0

@A64mQ

+RTS -A64m -AL128m -qn[cores]

letloc l^r = start(r)
Vrijeme pridruživanja: travanj 2019.

Tweetovi

Blokirali ste korisnika/cu @A64mQ

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

  1. Prikvačeni tweet
    28. lip 2019.

    But in a time when 50 megabytes of memory chips can be obtained for under $4000, there is less need for complex GC algorithms. Such techniques as reference-counting, ephemeral GC, closure analysis, etc., may not really be necessary now that it is possible to use massive memories.

    Poništi
  2. proslijedio/la je Tweet
    2. velj
    Odgovor korisniku/ci

    You might also enjoy lens-filesystem for wrangling and loading all those files!

    Poništi
  3. proslijedio/la je Tweet
    2. velj

    Sigh. Just deleted all my repos from bitbucket, migrating them to git and github. The dropping of Mercurial support is quite sad.

    Poništi
  4. proslijedio/la je Tweet
    2. velj

    Just launched 'lens-csv'; an optics library for manipulating and querying CSVs! It's a pretty natural operation and basically gives you a simple query and mutation language; effectively SQL for CSVs but as optics!

    Poništi
  5. proslijedio/la je Tweet
    2. velj
    Poništi
  6. 2. velj
    Poništi
  7. proslijedio/la je Tweet
    1. velj

    aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa (mentally preparing myself to see a lot of SIGSEGV)

    Poništi
  8. proslijedio/la je Tweet
    1. velj

    For anyone dares to try out: This is quite raw. But I'm working on a better/cleaner solution to make GHC codegen/RTS reusable.

    Poništi
  9. proslijedio/la je Tweet
    1. velj

    At this point it is looking likely that GHC will be moving to LLVM as its native toolchain on Windows; this will hopefully allow us to bypass many of the path and process issues that we have been historically fought with. Current plan can be found here:

    Prikaži ovu nit
    Poništi
  10. proslijedio/la je Tweet
    1. velj

    Programming languages without garbage collection send us down a long path of design decisions that lead to slow compile times and fragile runtime performance cliffs.

    Prikaži ovu nit
    Poništi
  11. proslijedio/la je Tweet
    1. velj
    Poništi
  12. proslijedio/la je Tweet
    1. velj

    Finally landed this one. Final numbers: - 77 changed files, +1132, -1030 - 292 comments in the MR - 91 CI runs - 7 months in the works Commit:

    Poništi
  13. proslijedio/la je Tweet
    31. sij

    It's taken a while, as he decided to make it compatible with 64-bit systems before releasing it, but, as I hinted at Code Mesh, David Turner has now released the Miranda programming language under a BSD licence:

    Prikaži ovu nit
    Poništi
  14. 31. sij

    кроме Typeable (Coercible - не тайпкласс)

    Poništi
  15. proslijedio/la je Tweet
    30. sij

    WebAssembly brings SIMD support to the Web. What is it? and explain and demonstrate how to use it to run native code on the Web even faster! 🔥 (This feature is currently experimental and available under a flag.)

    Poništi
  16. proslijedio/la je Tweet
    30. sij

    A lot gets written about how to write Haskell code, but much less about how to successfully hunt down performance bugs using profiling. That makes our latest blog post all the more interesting: “Locating performance bottlenecks in large Haskell codebases”

    Poništi
  17. 31. sij

    этот тред, конечно, бездонный колодец мудрости, хочется ретвитнуть буквально каждый реплай оттуда

    Poništi
  18. proslijedio/la je Tweet
    31. sij
    Odgovor korisnicima
    Poništi
  19. proslijedio/la je Tweet
    31. sij
    Odgovor korisnicima

    I remember intensional type analysis being a pretty painful mess in Rust; does Swift have characteristics that makes it easier or did they just do it anyway?

    Poništi
  20. proslijedio/la je Tweet
    31. sij
    Odgovor korisniku/ci

    Haskell has a uniform type representation. If you go down that road with a language like Rust you end up with Swift-like intensional type analysis, which gets hairy really fast.

    Poništi
  21. proslijedio/la je Tweet
    31. sij
    Odgovor korisniku/ci

    I don’t think you’d need a full bytecode interpreter to support runtime polymorphism, but just a bunch of RTTI mojo for boxing and unboxing values, and looking up traits by type via dictionary. Haskell type classes are implemented this way.

    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:

    ·