Tweets

You blocked @andreymokhov

Are you sure you want to view these Tweets? Viewing Tweets won't unblock @andreymokhov

  1. Pinned Tweet
    Jan 29

    This year the conference hosts the first Build Automation and Programming Languages workshop: If you are coming to PLDI or just happen to be in London on Saturday (20 June) morning, please attend and/or submit a talk!

    Show this thread
    Undo
  2. We can tweak the signature of `select` as follows: select :: f (() -> Either a b) -> f (a -> b) -> f (() -> b) Now we can get Dist (Either a b) -> Matrix Prob a b -> Dist b by instantiating `select` with `f (x -> y) = Matrix Prob x y`. No idea if this is useful but it's fun!

    Show this thread
    Undo
  3. Remember selective functors? Here they show up in the context of probabilistic programming where select :: f (Either a b) -> f (a -> b) -> f b turns into Dist (Either a b) -> Matrix Prob a b -> Dist b Here Dist is a vector i.e. 1-dimensional matrix: Dist a ~ Matrix Prob () a

    Show this thread
    Undo
  4. Retweeted
    Jan 30

    Our team at is hiring engineers and researchers in PL, compilers, systems etc. Come work with us on challenging problems and help shape the next generation of AI infrastructure!

    Undo
  5. Retweeted
    Jan 30

    Build Automation and Programming Languages (BAPL 2020) ... to explore the interaction of build automation and programming languages in systems for incremental analysis, building, testing, packaging, and deployment of software. At PLDI 2020 Contribute!

    Undo
  6. Jan 30

    Perhaps, O(n) parallel build complexity is just unavoidable for programming languages with type inference? I don't think this is the case in general. Specifically, can we improve the complexity of building Haskell or OCaml programs to O(1)? Has anyone explored this topic?

    Show this thread
    Undo
  7. Jan 30

    As an example consider building C programs, where all source files can be compiled in parallel, and building Haskell or OCaml programs, where modules must be compiled in an order respecting their dependencies. With infinite parallelism, the build complexity is O(1) vs O(n).

    Show this thread
    Undo
  8. Jan 30

    One topic I'm personally interested in discussing is build complexity. There is a lot of PL research about, say, the complexity of parsing or type inference for certain classes of programming languages but what about the complexity of building programs and large-scale projects?

    Show this thread
    Undo
  9. Jan 29

    Programming languages and build systems have historically been mostly evolving independently of each other. Our goal is to bring together build automation and programming languages experts to explore incremental analysis, building, testing, packaging and deployment of software.

    Show this thread
    Undo
  10. Retweeted
    Jan 13

    The change in the oceans' heat energy measured in zettajoules - that's 10^21 joules. It's incredible how much better fossil fuels are at making the Earth retain solar energy than they are at producing *useful* energy. Let's think about what a zettajoule means. (1/n)

    Show this thread
    Undo
  11. Retweeted
    Jan 4

    What if Agda is your only love, but they make you write Coq at work? Read this:

    Undo
  12. Retweeted

    The leadership of should be ashamed of themselves for signing on to this letter. Open access is the future, it is a moral imperative for publicly funded research, and the sooner it becomes universal and mandatory, the better.

    Undo
  13. Retweeted
    17 Dec 2019

    My favourite puzzle of 2019: A chessboard has a coin on every square. Someone points at a square. You are allowed to flip exactly one coin on the board. When your friend walks in the room they must identify the coin that was pointed to. What's the strategy?

    Show this thread
    Undo
  14. Retweeted

    Hey! Applied category theory postdoc positions are now open at the National Institute of Standards and Technology! Two years at $72,000/year, generous perks - what's not to like? Let me say a bit more about them. (1/n)

    Show this thread
    Undo
  15. Retweeted

    An absolute must-read for anyone even vaguely interested in antibiotic development -- this is reality: Biopharma has abandoned antibiotic development. Here’s why we did, too.

    Undo
  16. 12 Dec 2019

    Selective Applicative Functors in 17 minutes:

    Show this thread
    Undo
  17. Retweeted
    6 Dec 2019

    A super fun post. The whole KataGo experience shows how much benefit you can get in a machine learning context by leveraging a deep understanding of the problem-space, over an entirely generic solution.

    Undo
  18. Retweeted

    Can we actually remove carbon dioxide from the air? Yes! Can we remove enough to make a difference? Yes! But what are the best ways, and how much can they accomplish? I explain that in my new article in Nautilus, an online science magazine:

    Undo
  19. Retweeted
    2 Dec 2019

    Just a gentle reminder that , one of the world’s top places in Systems/SE/PL/Theory, is accepting PhD applications for August ‘20 intake by December 15, 2019. Feel free to reach out with questions! Details here: .

    Undo
  20. Retweeted
    20 Nov 2019

    Is this the largest prime number that can be written out in full, in base 10, in a single tweet, without using any tweet attachments such as polls or images?

    Undo

Loading seems to be taking a while.

Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.

    You may also like

    ·