News for hackers. Stuff that matters.
Re:Dependently Typed Programming by qu4z-2 on Tuesday July 01, 2014 @07:16PM (#7974081)
Or it just refuses to compile/execute something it can't prove terminates.
Re:Dependently Typed Programming by TheCoelacanth on Tuesday July 01, 2014 @08:05PM (#7974295)
That would make it non-Turing complete. Of course there probably aren't many interesting programs that are ruled out by that restriction.
Re:Dependently Typed Programming by marcosdumay on Tuesday July 01, 2014 @10:08PM (#7974729)
There are many interesting programs that don't ave any guarantee that they terminate. A a few that don't really terminate, ever.

In fact, if you click on the launcher menu on your computer, I'll bet most programs there just keep going, until some random event (AKA clicking on an "x") throws them out of the loop.

Re:Dependently Typed Programming by eru on Wednesday July 02, 2014 @02:36AM (#7975549)
That's why you'd ask your programs to be `productive'. Also look up co-recursion and co-data, if you want to find out more about this.

(It's basically the logical way to extend `termination' from batch programs to things like continuously running programs like operating systems.)

Re:Dependently Typed Programming by TheCoelacanth on Tuesday July 01, 2014 @10:24PM (#7974772)
It wouldn't require that all programs terminate, just that all functions terminate.
Re:Dependently Typed Programming by marcosdumay on Tuesday July 01, 2014 @10:48PM (#7974848)
Your programs aren't composed of one top-level function?
Re:Dependently Typed Programming by TheCoelacanth on Tuesday July 01, 2014 @10:51PM (#7974857)
More likely they would be composed on one top-level IO value, like in Haskell, or something similar.
Re:Dependently Typed Programming by qu4z-2 on Wednesday July 02, 2014 @08:50PM (#7980817)
That is a very good point.