Near optimal hierarchical encoding of types | Zendy

Andreas Krall | Zendy; Jan Vítek | Zendy; R. Nigel Horspool | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Near optimal hierarchical encoding of types

Author(s) -

Andreas Krall,

Jan Vítek,

R. Nigel Horspool

Publication year - 1997

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/bfb0053377

Subject(s) - subtyping , computer science , bit array , type (biology) , theoretical computer science , hierarchy , encoding (memory) , algorithm , java , programming language , artificial intelligence , ecology , economics , market economy , biology

. A type inclusion test is a procedure to decide whether twotypes are related by a given subtyping relationship. An efficient implementationof the type inclusion test plays an important role in the performanceof object oriented programming languages with multiple subtypinglike C++, Eiffel or Java. There are well-known methods for performingfast constant time type inclusion tests that use a hierarchical bitvector encoding of the partial ordered set representing the type hierarchy.The...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research