Latent typing

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

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]


  1. Allen B. Tucker (28 June 2004). Computer Science Handbook, Second Edition. Taylor & Francis. pp. 92–. ISBN 978-1-58488-360-9.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
  2. Benjamin C. Pierce (January 2002). Types and Programming Languages. MIT Press. pp. 2–. ISBN 978-0-262-16209-8.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>

See also