4 ms·
How does copilot fair in a language where correctness or at least well soundness is more transparent, for example Haskell (eg at least making sure all the types
by foxes 5y ago
How does copilot fair in a language where correctness or at least well soundness is more transparent, for example Haskell (eg at least making sure all the types are correct, actual logic on the other hand seems harder, but maybe the declarative style helps)? I imagine in a less strict language you can generate garbage more easily.
- toomanyducks 5y agoSome of the examples given wouldn't even run, as far as I know. Copilot writing Haskell/Rust/<insert your intricate type system lang here> would probably just fail to compile. I know very, very little about AI, but, like the OP said, it'll reproduce the traits of its training distribution. If the traits don't map on to the domain-specifics of the type ssytem, the traits don't map on, and the code fails. Generating garbage the compiles is harder, but generating garbage in general is just as easy.
- truth_ 5y agoYeah, I chanced upon an official livestream by GH showcasing Copilot, and it was performing very poorly on Rust.
- exdsq 5y agoBuilding on this idea, if you could design a type-level program with Haskell (including some liquid Haskell to add further type invariants) it'd be awesome for something like Copilot to fill in the blanks. Seems easier than program synthesis!