typeapplicationw3cdjson

Type application is the process of supplying explicit type arguments to a polymorphic function or type, selecting a concrete instantiation of a generic construct. It appears in statically typed languages that support parametric polymorphism and, in some forms, higher-ranked or higher-kinded types. The practice complements type inference by making chosen types explicit and can be necessary when inference is ambiguous or insufficient to determine a unique instantiation.

In languages that support explicit type arguments, type application can resolve ambiguity, enable use of specific type class or trait instances, and allow programmers to exercise precise control over type behavior. In Haskell, the TypeApplications extension permits explicit type arguments to be supplied in a form such as read @Int "123", directing the compiler to instantiate read with the Int type. Other languages implement type application in various forms: Scala uses explicit type parameters like f[Int](x); Rust offers turbofish syntax such as function::<i32>(...). Type application can also target type constructors, not just functions, enabling the instantiation of generic types with concrete parameters.

Benefits include greater control over type inference, support for higher-kinded or higher-ranked types, and enabling certain abstractions in library design. Drawbacks include increased verbosity and potential for more complex type errors. As a design feature, type application interacts with other language features such as type classes, implicits, or generics. The concept has its roots in foundational type-theoretic work on polymorphic lambda calculi and remains a common tool in modern statically typed languages to manage type instantiation explicitly.