Subtype Polymorphism
978-613-0-50607-0
6130506074
116
2010-06-18
39,00 €
eng
https://images.our-assets.com/cover/230x230/9786130506070.jpg
https://images.our-assets.com/fullcover/230x230/9786130506070.jpg
https://images.our-assets.com/cover/2000x/9786130506070.jpg
https://images.our-assets.com/fullcover/2000x/9786130506070.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In programming language theory, subtyping or subtype polymorphism is a form of type polymorphism in which a subtype is a datatype that is related to another datatype (the supertype) by some notion of substitutability, meaning that program constructs, typically subroutines or functions, written to operate on elements of the supertype can also operate on elements of the subtype. If S is a subtype of T, the subtyping relation is often written S <: T, to mean that any term of type S can be safely used in a context where a term of type T is expected. The precise semantics of subtyping crucially depends on the particulars of what "safely used in a context where" means in a given programming language. The type system of a programming language essentially defines its own subtyping relation, which may well be trivial.
https://www.morebooks.de/books/it/published_by/betascript-publishing/1/products
Informatica
https://www.morebooks.de/store/it/book/subtype-polymorphism/isbn/978-613-0-50607-0