3 ms·
The type language's expressiveness is definitely more limited than the term language, but "very inexpressive" is overstating the case. You end up grouping C, fo
by naasking 9y ago
The type language's expressiveness is definitely more limited than the term language, but "very inexpressive" is overstating the case. You end up grouping C, for which your claim is absolutely true, along with Agda for which your claim is not really true.
Regardless, even with Java's limited expressiveness you can encode some powerful propsitions, as the paper I linked shows.
- deleted 9y ago[deleted]
- seanmcdirmid 9y agoIt may be that COQ and Agda have expressive type systems, but who is writing programs with them? They are not general purpose. The paper you linked uses Java's type system for a mechanized proof, meaning...you probably don't want to be writing that out by hand.
- naasking 9y ago> It may be that COQ and Agda have expressive type systems, but who is writing programs with them? They are not general purpose. I think that's overstating it a little too. You don't have to use the dependent types, at their core, Coq and Agda are still functional languages and you can just stick to algebraic sums and products and still enjoy type inference. Most people aren't using these languages for general purpose programming because a) poor tooling, and b) because they are explicitly marketed as research languages.
- seanmcdirmid 9y agoMore than that, they are explicitly meant to be proof assistants.
- kerkeslager 9y agoYeah, that paper is interesting, and I've definitely leveraged Java's types to verify some pretty powerful assertions.