Sponsor
This work has been partially supported by the Swiss National Foundation, by the J.M. Murdock Charitable Trust, and by the National Science Foundation of the United States under awards CDA-9703218, CCR-0098323, and CCR-031340.
Published In
Computer Languages, Systems & Structures
Document Type
Post-Print
Publication Date
9-2003
Subjects
Computer software -- Development, Browsers (Computer programs), Smalltalk (Computer program language)
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.
DOI
10.1016/j.cl.2003.09.004
Persistent Identifier
http://archives.pdx.edu/ds/psu/11951
Citation Details
Schärli, Nathanael, and Andrew P. Black. "A browser for incremental programming." Computer Languages, Systems & Structures 30.1 (2004): 79-95.
Description
NOTICE: this is the author’s version of a work that was accepted for publication in Computer Languages, Systems & Structures. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computer Languages, Systems & Structures, [v.30, Iss. 1-2, (April-July 2004)] DOI#10.1016/j.cl.2003.09.004