Latent typing explained

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

• Duck typing

Notes and References

1. Book: Allen B. Tucker. Computer Science Handbook, Second Edition. 28 June 2004. Taylor & Francis. 978-1-58488-360-9. 92–.
2. Book: Benjamin C. Pierce. Types and Programming Languages. January 2002. MIT Press. 978-0-262-16209-8. 2–.