[schtog]

how is Lisp/Scheme weakly typed? It is dynamically typed and strongly too(even though the strong/weak typing definition isn't exactly clear).

[visitor4rmindia]

I'm sorry. You're right - that was a slip-up. I meant a non-static (dynamic) typed language.

[ricky_clarkson]

Lisp/Scheme are untyped.

[Hexstream]

No, they're duck-typed. Types are attached to values, not variables, and for example trying to eval (+ 1 "hi") will throw a proper type exception.

You usually don't have to declare types but for example in Common Lisp you can optionally declare types for better performance in speed-critical parts of the code.

[ricky_clarkson]

They're an implementation of the untyped lambda calculus. What you're thinking of are better named tags, not types.