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.
This programming language theory or type theory-related article is a stub.
You can help Wikipedia by expanding it.This programming-language-related article is a stub.