Name
Abstract | ||
|---|---|---|
Much of the elegance and power of Smalltalk comes from its programming environment and tools. First introduced more than 20 years ago, the Smalltalk browser enables programmers to ''home in'' on particular methods using a hierarchy of manually-defined classifications. By its nature, this classification scheme says a lot about the desired state of the code, but little about the actual state of the code as it is being developed. We have extended the Smalltalk browser with dynamically computed virtual categories that dramatically improve the browser's support for incremental programming. We illustrate these improvements by example, and describe the algorithms used to compute the virtual categories efficiently. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.cl.2003.09.004 | Computer Languages, Systems & Structures |
Keywords | Field | DocType |
virtual category,requires set.,requires set,incremental programming,trait conflict.,intentional programming,particular method,classification scheme,actual state,smalltalk browser,dynamically computed virtual category,programming environment,method reachability,manually-defined classification | Programming language,Computer science,Classification scheme,Smalltalk,Intentional programming,Hierarchy,Higher-order programming,Programming language implementation | Journal |
Volume | Issue | ISSN |
30 | 1-2 | Computer Languages, Systems & Structures |
Citations | PageRank | References |
6 | 1.08 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathanael Schärli | 1 | 187 | 10.59 |
| Andrew P. Black | 2 | 1566 | 366.84 |