Unfortunately, type soundness has only been established for a very restricted subset of DOT (muDOT), and it has been shown that adding important Scala features such as type refinement or extending subtyping to a lattice breaks at least one key metatheoretic property such as narrowing or subtyping transitivity, which are usually required for a type soundness proof. The first main contribution of this paper is to demonstrate how, perhaps surprisingly, even though these properties are lost in their full generality, a richer DOT calculus that includes both type refinement and a subtyping lattice with intersection types can still be proved sound.

The previous poster is exactly correct. The McWorker should never expect to prosper with such a job. If McDonalds is the height of his ambition then he has chosen his own poverty level. I do not by this mean that someone should not choose to be a McWorker if that met his current needs. But to clain that the system should change is decision to suit his needs is preposterous.

veiling its enormity, and its indefensibility

I must say, that, at the coronation, there was little vestige left as possible of the charms that pleased a king. She looked, Lady Mary Wortley said, like an Egyptian mummy, wrought with hieroglyphics of gold.