Latent typing
From HandWiki
Short description: Type system where types are associated with values and not variables
| Type systems |
|---|
| General concepts |
| Major categories |
|
| Minor categories |
| See also |
In computer programming, latent typing refers to a type system where types are associated with values and not variables.[1] An example latently typed language is Scheme. This typically requires run-time type checking and so is commonly used synonymously with dynamic typing.[2]
See also
References
- ↑ Allen B. Tucker (28 June 2004). Computer Science Handbook, Second Edition. Taylor & Francis. pp. 92–. ISBN 978-1-58488-360-9. https://books.google.com/books?id=9IFMCsQJyscC&pg=SA92-PA27.
- ↑ Benjamin C. Pierce (January 2002). Types and Programming Languages. MIT Press. pp. 2–. ISBN 978-0-262-16209-8. https://books.google.com/books?id=ti6zoAC9Ph8C&pg=PA2.
 |  |
