登入選單
返回Google圖書搜尋
Set Representations in a Subset-equational Language
註釋Abstract: "This thesis investigates alternative set representations in the subset-equational language SEL. The current SEL implementation represents sets using unordered lists for the sake of simplicity and for compatibility with the Warren Abstract Machine (WAM). This thesis explores a potentially better representation, namely, hash tables, following some of the techniques proposed in the imperative, set- oriented language SETL. We examine the way in which sets are usually generated in SEL, and then propose a suitable hash table implementation. We compare the two approaches (lists vs. hash tables), and examine the ease of performing optimizations in both approaches