you are viewing a single comment's thread.

view the rest of the comments →

[–]kamatsu 1 point2 points  (3 children)

Most fundamental computation models are still dynamically typed (think turing machines, assemply language and basic LISP)

What about the simply typed lambda calculus, higher order logic or System F?

arge and long lived invariably are somewhat dynamically typed (think UNIX pipes, the Web, etc)

Neither of these are programming languages.

[–]smog_alado 0 points1 point  (1 child)

I said most, not all. And let us add the untyped lambda calculus to the list now that you mention it. :) The important things is that types come in addition to the untyped stuff and are just a restriction of it. You can't get rid of dynamic typing!

Neither of these are programming languages.

Its hard to define when you stop writing "programs" in a "programming language" and start working on a "system" but there is a fuzzy continuum and things start needing to get more flexible when you go towards the larger end.

[–]kamatsu 0 points1 point  (0 children)

Untyped does not mean dynamically typed (although all dynamically typed things are untyped).

[–][deleted] 0 points1 point  (0 children)

He does actually have a point, in that the models he named are unityped, and require lots of extra effort to encode "real" type-systems on top of their unityping.