News for hackers. Stuff that matters.
Re:Type Systems (2004) [pdf] by lisper on Thursday August 31, 2017 @02:04PM (#15142364)
> Languages where variables can be given (nontrivial) types are called typed languages.

This is a vacuous definition because it doesn't specify what is meant by "variable" or what it means to be "given a type." This is not nit-picking. It actually matters in the case of Common Lisp. Consider:

(let ((x 1)) (declare (fixnum x)) ...)

X is clearly a variable, but has it been "given a type"? In CL, type specifications are promises to the compiler, not specifications of program semantics. (declare (fixnum x)) means "I, the programmer, promise to write my code in such a way that the value of X will always be a fixnum, and you the compiler are free to assume that I will do this correctly in order to make my code run faster."

On the other hand:

(setf x (make-array 10 :element-type 'fixnum))

In this case the implementation is allowed (though not required) to make an array that can only hold fixnums. So are the array elements variables? And have they been "given a type"?

Re:Type Systems (2004) [pdf] by lispm on Thursday August 31, 2017 @02:24PM (#15142554)
Well SBCL/CMUCL/SCL try to be different. From the SBCL manual:

> all type declarations that have not been proven to always hold are asserted at runtime

Re:Type Systems (2004) [pdf] by adrianratnapala on Thursday August 31, 2017 @09:17PM (#15145409)
I think we can forgive such stuff at least in the intro. This document is clearly an introduction to type systems for people who know more about programming than they do about the underlying maths and logic of type theory. Good.

Also good is that it starts from what the reader knows informally rather than trying to build everything rigorously from the ground up.

Re:Type Systems (2004) [pdf] by catnaroek on Thursday August 31, 2017 @09:29PM (#15145470)
> Also good is that it starts from what the reader knows informally rather than trying to build everything rigorously from the ground up.

It's certainly pragmatic, but is it good? Maybe I'm biased as a math student, but I've seen first-hand the horrors that happen when people think they know something just because they have a vague intuition about the topic's main ideas.

Re:Type Systems (2004) [pdf] by adrianratnapala on Thursday August 31, 2017 @10:46PM (#15145737)
But whenever I have learned maths in strict lemma-proof form it was on the second time around. That is, I first had a general sense of the field and intuition about concepts and some of the results, and then rigorous stuff makes sense.

From everything I've read about how mathematicians work, I thought that was normal.

Re:Type Systems (2004) [pdf] by catnaroek on Thursday August 31, 2017 @09:30PM (#15145471)
> In CL, type specifications are promises to the compiler, not specifications of program semantics.

Then they aren't types.

Re:Type Systems (2004) [pdf] by rurban on Friday September 01, 2017 @07:02AM (#15147432)
Most of them are type hints. Perl6 and cperl have a similar distinction. Hard types and compiler hints. In an FFI context it's a hard type, with arrays or structs also, with primitives the compiler may ignore it or allow otherwise permitted temporary casts.
Re:Type Systems (2004) [pdf] by catnaroek on Friday September 01, 2017 @08:36AM (#15147836)
> Most of them are type hints. Perl6 and cperl have a similar distinction.

Why are so-called “type hints” interesting in? The real value in a type system is:

(0) Not having to worry about large classes of mistakes. They just don't happen in a legal program.

(1) Enforcing abstractions, i.e., not allowing library users to make decisions based on library implementation details.

(2) Managing the verification effort. Proving that a program meets its specification becomes much easier when components are guaranteed not to violate the assumptions made in each other's design.

A “type system” that can't do any of these is just a waste of engineering effort.

Re:Type Systems (2004) [pdf] by rurban on Wednesday September 06, 2017 @10:06AM (#15183753)
Yes, and much more. types also allows lowering generic ops to fast ops, which is typically 10x faster then without types.
Re:Type Systems (2004) [pdf] by catnaroek on Saturday September 09, 2017 @05:14PM (#15209187)
I'd love to read about how you can use so-called “type hints” to mechanically rule out programs that inspect the internal representation of abstractions provided by third parties.
Re:Type Systems (2004) [pdf] by hyperpape on Thursday August 31, 2017 @08:45PM (#15145271)
I believe that most type theorists will say that's not a type, since it is trivially unsound. Otherwise a Python program is typed, so far as the programmer sorta halfway thinks about types ("I can iterate over this") at some point.
Re:Type Systems (2004) [pdf] by lisper on Thursday August 31, 2017 @09:01PM (#15145346)
> it is trivially unsound

Why? (And what is the antecedent of "it"?)

Re:Type Systems (2004) [pdf] by hyperpape on Friday September 01, 2017 @01:47PM (#15150747)
The program containing the declaration is unsound because it doesn't preclude using the variable in ways inconsistent with the declaration.
Re:Type Systems (2004) [pdf] by lisper on Friday September 01, 2017 @01:59PM (#15150885)
Ah. In that case:

> that's not a type, since it is trivially unsound

You are misunderstanding what a type is. A type is just a subset of all of the possible data values in a language. Types by themselves don't do anything.

Re:Type Systems (2004) [pdf] by hyperpape on Friday September 01, 2017 @03:27PM (#15151690)
It doesn't count as an assignment of a type to a variable because it's trivially unsound. Are you happy with the rewording?
Re:Type Systems (2004) [pdf] by lisper on Friday September 01, 2017 @03:39PM (#15151768)
OK, but:

1. CL implementations are free to do static type analysis based on declarations (and some do) and they are also free to signal run-time errors if you assign a value not of the declared type (and some do).

2. Not all storage locations are variables, e.g.:

    Welcome to Clozure Common Lisp Version 1.10-r16479M  (DarwinX8664)!
    ? (setf a (make-array 10 :element-type '(unsigned-byte 32)))
    #(0 0 0 0 0 0 0 0 0 0)
    ? (setf (aref a 0) 'foo)
    > Error: FOO doesn't match array element type of #<VECTOR 10 type (UNSIGNED-BYTE 32), simple>.
The point is that focusing on "variables" makes tacit assumptions about programming languages that aren't necessarily true.
Re:Type Systems (2004) [pdf] by junke on Thursday August 31, 2017 @02:36PM (#15142673)
The hyperspec has a definition of what is a variable in the different namespaces. Also, for type declarations:

"Affects only variable bindings and specifies that the vars take on values only of the specified typespec"

Re:Type Systems (2004) [pdf] by lisper on Thursday August 31, 2017 @03:41PM (#15143240)
> The hyperspec has a definition of what is a variable

The hyperspec's definition only applies to the hyperspec, not the paper. On the hyperspec's definition, an array cell is not a variable, but it seems very unlikely that this is what the author of the paper intended. It's much more likely that what the author intended by "variable" the CLHS calls a "place". (But this is exactly the problem: we don't know what the author of the paper intended because he didn't say. We have to guess.)

> vars take on values only of the specified typespec

Right, but the spec doesn't actually say what happens when this constraint is violated.

Re:Type Systems (2004) [pdf] by junke on Thursday August 31, 2017 @05:02PM (#15143892)
> On the hyperspec's definition, an array cell is not a variable, but it seems very unlikely that this is what the author of the paper intended. It's much more likely that what the author intended by "variable" the CLHS calls a "place".

There is no syntax to declare the type of a single cell, you can only put identifiers (symbols), not places, into declarations. Either your variable is declared to hold an array of, say, fixnums, or you bind a variable to the content of a cell and declare the type of that variable.

> Right, but the spec doesn't actually say what happens when this constraint is violated.

The spec says the consequences are undefined. Either you code against the guarantees of your implementation (which are hopefully more precise), or you aim for portability and consistently add check-type before locally declaring types.

Re:Type Systems (2004) [pdf] by lisper on Thursday August 31, 2017 @05:17PM (#15144013)
> the spec doesn't actually say what happens when this constraint is violated.

> The spec says the consequences are undefined.

Don't those mean the same thing?

Re:Type Systems (2004) [pdf] by junke on Thursday August 31, 2017 @05:39PM (#15144181)
Let's try the Zen/taoist analogy.

At the end of the day, a Zen master tells his student: "your next lesson will start at 5am tomorrow, don't be late"; the student says: "what will happen if I am late?". The master doesn't reply.

The student goes to sleep and wakes up late. "You missed your lesson, come back tomorrow at 4am or else I can't guarantee your safety.". The next day, the student arrives on time.

----

Saying things are undefined is an explicit way of demarcating what is part or not of the specification. Otherwise, the meaning could ambiguous.

Re:Type Systems (2004) [pdf] by lisper on Thursday August 31, 2017 @05:51PM (#15144273)
OK. That seems like a pretty fine hair to split in the context of the present discussion.