Latent typing

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]

Type systems
General concepts
Type safety Strong vs. weak typing
Major categories
Static vs. dynamic Manifest vs. inferred Nominal vs. structural Duck typing
Minor categories
Abstract Dependent Flow-sensitive Gradual Intersection Latent Refinement Substructural Unique Session

See also

Duck typing

References

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

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.