Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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


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


Lisp/Scheme are untyped.


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.


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




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: