## An assumption set is a set containing signature assertions and assertions of the form a ? b.

## If ? is an assertion set and A an assumption set, the pair (?, A) is inconsistent if, for example, any of the following are true.

- ? ? A is an inconsistent assertion set.
- a ? b ? A, a:class ? ?, b:interface ? ?, a is closed with respect to ? but (a,b) ? ? *?
- Intuitively, a closed means that all of its subclasses and implemented interfaces have are in ?
- n.f:t ? A, n:class ? ? or n:interface ? ?, but n.f:t ? ?

## A consistent pair (?, A) is a typing context.

Previous slide | Next slide | Back to first slide | View graphic version |