4 ms·
> Idris can often infer entire functions from their types if the domain is amenable to accurate type-based specification. This is a great example of what I'm t
by pron 9y ago
> Idris can often infer entire functions from their types if the domain is amenable to accurate type-based specification.
This is a great example of what I'm talking about. The kind of functions Idris can generate is that of functions that you could manually write with only marginally more effort -- if that -- than the effort required to write the precise type. I don't think those functions ever form a significant portion of a significant program, if at all (those functions must be so generic, or else there would be a search problem that Idris can't solve, that they would already likely be in the standard libraries). When Idris is able to generate an efficient sorting function given some constraints, then I'd be impressed.
> can be automatically generated via the interactive "proof search" mechanism
If you've spent a significant amount of time with such proof assistants, you'd see that the proof search is rather pitiful.
- bjz_ 9y ago> If you've spent a significant amount of time with such proof assistants, you'd see that the proof search is rather pitiful. Afaik, Idris' proof search was hacked together in an afternoon just to see if it would work. And it did, surprisingly well considering. Don't know how much it has been worked on since then though. But yes, still leaves a bit to be desired compared to other systems.
- pron 9y agoI wasn't just talking about Idris. There isn't a single tool out there that can automatically prove that your quicksort implementation actually sorts without pretty significant work.