Go backward to Object Oriented Programming
Go up to Top
Go forward to Points and Tiles
Bounded Existential Quantification and Partial Abstraction
- Bounding existential quantifiers:
- exists a <=t. t'
- exists a. t := exists a <=Top. t
- Partially abstract types:
- is abstract.
- We know is subtype of .
- is not more abstract than is.
- Modified packing construct:
- pack [a <= t = t' in t"] e
Wolfgang.Schreiner@risc.uni-linz.ac.at
Id: understand.tex,v 1.1 1996/06/12 09:38:21 schreine Exp schreine