Remix.run Logo
layer8 2 hours ago

You aren’t giving any justification why proofs should necessarily map to data structures.

amavect 2 hours ago | parent [-]

Not necessarily, I only argue for utility. You can find better justification in the Curry-Howard correspondence.

pron an hour ago | parent [-]

How have you used the Curry Howard correspondence to make proving the correctness of non-trivial algorithms easier (than, say, Isabelle/HOL or TLA+ proofs)?