This was a great talk, talks about proof languages are usually too high-level/academic for my small engineer brain, but I was able to follow this one without any problem. I wish there had been a comparison with Ada/Spark though as I’m unsure what ATS offers over these.

I wouldn’t necessarily call ATS a “proof language” just because you can do proofs in it. Much of your code would, realistically, not be proven correct. When you say “proof language”, I think of languages exclusively for mathematical proving, like e.g. HOL Light.

Counterpoint: Why single-owner memory semantics aren’t the right choice for a high-level systems language. (More discussion on reddit.)

FWIW I am a fan of ats.

This was a great talk, talks about proof languages are usually too high-level/academic for my small engineer brain, but I was able to follow this one without any problem. I wish there had been a comparison with Ada/Spark though as I’m unsure what ATS offers over these.

I wrote a post comparing Ada/Spark and ATS in the area of proving program invariants if interested.

Glad you liked it :)

I wouldn’t necessarily call ATS a “proof language” just because you can do proofs in it. Much of your code would, realistically, not be proven correct. When you say “proof language”, I think of languages exclusively for mathematical proving, like e.g. HOL Light.