News for hackers. Stuff that matters.
Re:A blog engine written and proven in Coq by more_original on Thursday February 12, 2015 @09:32AM (#9038894)
In Coq all functions terminate.

Coq's correctness depends on termination. In Coq the propositions are types. To prove a proposition is to construct a program of this type. If one allowed non-termination, then it would be easy to construct a program of any type (like in OCaml let rec f() = f() has type () -> 'a), so you could prove anything.

Re:A blog engine written and proven in Coq by seanwilson on Thursday February 12, 2015 @10:27AM (#9039138)
I didn't say anything that disagrees with that...I was simply trying to give an easy to understand example for how you justify to a computer that a function will always terminate from the perspective of someone who has never used Coq or another theorem prover.

In this context, it's isn't very illuminating to tell a non-Coq user that all Coq functions terminate; formulating your function definition into something that Coq will accept is the difficult part.

Re:A blog engine written and proven in Coq by more_original on Thursday February 12, 2015 @10:45AM (#9039254)
I see. You said "you can prove many functions in Coq terminate", so it seemed you were talking about functions written in Coq.
Re:A blog engine written and proven in Coq by seanwilson on Thursday February 12, 2015 @11:11AM (#9039407)
Ah, I meant that in the sense of, think of an algorithm you want to write, many of them are structurally recursive and they're straightforward to implement in Coq.