<p>Examples:
<a href="http://www.lispworks.com/documentation/HyperSpec/FrontMatter/">Common-Lisp</a>,
<a href="http://www.erlang.org/">Erlang</a>,
<a href="http://www.mozart-oz.org/">Mozart/Oz</a>,
<a href="http://library.readscheme.org/">Scheme</a>,
<a href="http://www.smalltalk.org/">Smalltalk</a>,
Assembler
</p>
<p>
XXX This is not entirely true for some implementations of
those languages. They define subsorts (<em>subtypes</em>) of
the universal sort and function types which allows type
inference to some extent.<br/>
XXX Also, how do function types (cue word <em>simply typed</em>)
fit in there?
</p>
<p>
Examples:
<a href="http://www.lispworks.com/documentation/HyperSpec/FrontMatter/">Common-Lisp</a>,
<a href="http://www.erlang.org/">Erlang</a>,
<a href="http://www.mozart-oz.org/">Mozart/Oz</a>,
<a href="http://library.readscheme.org/">Scheme</a>,
<a href="http://www.smalltalk.org/">Smalltalk</a>
<br/>
(Note how these overlap with <em>unityped</em> languages!)
<br/>
</p>