This year the @PLDI conference hosts the first Build Automation and Programming Languages workshop: https://pldi20.sigplan.org/home/bapl-2020
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!
-
-
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?
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoniš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.