3 ms·
> a type system corresponds to a particular logic system. Then the article proceeds to not conretely define what a "Type System" is. They just say: oh like tho
by hnisstupid 12y ago
> a type system corresponds to a particular logic system.
Then the article proceeds to not conretely define what a "Type System" is. They just say: oh like those things that Haskel and OCaml do.
Then they just jump to concluding:
> Type systems don’t correspond to classical logic, but to something called “constructive logic”.
Wait, what? Why? And please don't explain constructive logic as your explanation of 'why'. That doesn't explain the presumption above. In fact, you still have not even told us what exactly you mean by Type System.
> correspond to propositional logic
So, by Type Systems we mean a Heyting Algebra?
> dependent types are first-order predicate logic
So dependent types are algebras that carry the same properties as propositional logic? But, I thought Type Systems were the logic?
> Type-based logic forces us to use constructive logic rather than classical logic
This is a completely different conclusion than the premise of the article.
It seems, that the author has a good understanding of a not well understood relationship i.e. the relationship between Types and and what we refer to as "a logic".
- vilhelm_s 12y agoWell, there isn't any generally accepted definition of what a type system is. _Types and Programming Languages_ (2002) start out with the sentence "a type system is a tractable syntactic method for proving the absence of certain program behaviors by classifying phrases according to the kinds of values they compute", a definition which is both not very precise ("tractable"?) and is also not general enough to cover dependent types (where we care about both presence and absence of behaviors). Similarly, there isn't really any definition of a logic. Some authors talk about a proof system + a semantics, which is also not precise, and also not general enough (some constructivists don't want the semantics). So it seems hard to do better than this?
- deleted 12y ago[deleted]
- JadeNB 12y ago> "a type system is a tractable syntactic method for proving the absence of certain program behaviors by classifying phrases according to the kinds of values they compute" … not general enough to cover dependent types (where we care about both presence and absence of behaviors). As someone who's comfortable with an informal approach to mathematical logic but has never done any programming with dependent types, I wonder if this may be hitting on a fundamental point. Certain presences can be interpreted as absences, i.e., the absence of their absence, in just the same way as certain statements can be interpreted as the negations of their negations. (In classical logic, but not in constructivist logic, all statements can be so interpreted.) Is there any chance that the 'presences' needed in dependent type theory are those that can be expressed as the 'absence of an absence' (something like that it is not so important what characteristics an object does have, as what assumptions about the object can't go wrong)?
- vilhelm_s 12y agoThe "presence" I had in mind was just "this function will eventually return a value", i.e. what you get from having a type for total functions. (On the programming side, this ties into a discussion about "safety" versus "liveness" properties).
- adamnemecek 12y ago> It seems, that the author has a good understanding of a not well understood relationship i.e. the relationship between Types and and what we refer to as "a logic". The article was probably not meant for you. It's probably meant for someone not familiar with the subject who can handle some hand-waving. But way to be an ass about it.
- hnisstupid 12y agoThe meaningless downvoting on a a sufficiently thorough and well-educated comment is clear evidence of the worthlessness of Hacker news. Jesus fucking christ.