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.
-
-
Prikaži ovu nit
-
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?
Prikaži ovu nit -
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).
Prikaži ovu nit -
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 nit
Kraj razgovora
Novi razgovor -
Č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.