Type erasure
In
run-time. Operational semantics not requiring programs to be accompanied by types are named type-erasure semantics, in contrast with type-passing semantics. Type-erasure semantics is an abstraction principle, ensuring that the run-time execution of a program doesn't depend on type information. In the context of generic programming, the opposite of type erasure is named reification.[1]
Type inference
The reverse operation is named
Rule of inference
for this definition.
See also
- Template (C++)
- Problems with type erasure (in Generics in Java)
- Monomorphization
- Type polymorphism
References
- ^ Langer, Angelika. "What is reification?".
- Crary, Karl; .
 | This computer science article is a stub. You can help Wikipedia by expanding it. |