all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127 CHAPTER 12. TYPES 128 • There is no 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite

all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127 CHAPTER 12. TYPES 128 • There is no 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants commonly called "top" because it is at the apex of the type graph. Julia also has a predefined abstract "bottom" type, at the nadir of the type graph, which is written as Union{}. It is the exact opposite