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]

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.

\Gamma \!\vdash

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. You can help Wikipedia by expanding it.

[Tucker2004-1] Allen B. Tucker (28 June 2004). Computer Science Handbook, Second Edition. Taylor & Francis. pp. 92–. ISBN 978-1-58488-360-9.

[Pierce2002-2] Benjamin C. Pierce (January 2002). Types and Programming Languages. MIT Press. pp. 2–. ISBN 978-0-262-16209-8.

[1]

[2]

See also

References