News for hackers. Stuff that matters.
Re:A Functional Programming Influence Graph by omaranto on Wednesday May 02, 2012 @07:46PM (#3921753)
In the dependently typed family of languages it's a little bit arbitrary to divide between programming languages and proof assistants since everyone in this space can be made to play both roles in a pinch. I think most people think of Coq as more on the proof assistant side and Agda more on the programming language side.
Re:A Functional Programming Influence Graph by Locke1689 on Thursday May 03, 2012 @01:00AM (#3922440)
Sort of. Dependent types doesn't explain Coq's requirement for pure, total functions. Unless this restriction is weakened I cannot see it as being useful in any general-purpose domain. Agda may be looser.
Re:A Functional Programming Influence Graph by DanWaterworth on Thursday May 03, 2012 @02:32AM (#3922655)
> Dependent types doesn't explain Coq's requirement for pure, total functions.

That's where you are wrong. Partial functions introduce the bottom value and then you can 'prove' arbitrary incorrect things.

Re:A Functional Programming Influence Graph by Locke1689 on Thursday May 03, 2012 @03:23AM (#3922769)
I'm not sure what you're saying. I was saying that simply being dependently typed doesn't necessitate pure total functions. Obviously, these features can be considered either highly suggested or necessary for ITPs. There are a number of ways you can get around totality with dependent types.