latent typing
{{short description|Type system where types are associated with values and not variables}}
{{type systems}}
In computer programming, latent typing refers to a type system where types are associated with values and not variables.{{cite book|author=Allen B. Tucker|title=Computer Science Handbook, Second Edition|url=https://books.google.com/books?id=9IFMCsQJyscC&pg=SA92-PA27|date=28 June 2004|publisher=Taylor & Francis|isbn=978-1-58488-360-9|pages=92–}} An example latently typed language is Scheme. This typically requires run-time type checking and so is commonly used synonymously with dynamic typing.{{cite book|author=Benjamin C. Pierce|title=Types and Programming Languages|url=https://books.google.com/books?id=ti6zoAC9Ph8C&pg=PA2|date=January 2002|publisher=MIT Press|isbn=978-0-262-16209-8|pages=2–}}
See also
References
{{Reflist}}
{{DEFAULTSORT:Latent Typing}}
{{plt-stub}}
{{compu-lang-stub}}