Hello,
Have any of you tried the proof assistants (lean, coq etc)? Is it applicable to the problems of the site?
thank you
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hello,
Have any of you tried the proof assistants (lean, coq etc)? Is it applicable to the problems of the site?
thank you
Name |
---|
I actually wrote a short blog, using CP problems as an introduction to Coq. Coq in particular has an extraction mechanism that allows you to prove a function correct according to a specification, and then extract it into a Ocaml/Haskell program you can submit to CF and most judges.
Now doing so in-contest is not really useful/feasible. Also, I don't think proof assistants like Coq or Lean are well-suited for reasoning about imperative programs; there are some languages like Dafny that might be more appropriate for that.
I didn't imagine to use it during a contest ^^ I was going for lean, do you think that coq is more suitable? The coq code is much less readable than lean....
I'm not sure exactly what your goal is, but IMO the two are fairly similar.
It's hard going. But it's worth giving a try. I'm working on CoqCP, a repository of formalized CP proofs. No running programs yet, but there will be some. The repository is still in its early stages. I want the repository to be bigger and cover more CP problems. It would take me a lot of practice to be able to use the technology in contest, but I'm working to get there.