Wilfred J. Hansen

dblp:43/1005 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 1992
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 100%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems
data types
0.011992
Subsequence References: First-Class Values for Substrings · ACM Trans. Program. Lang. Syst. 1992
Programming languages and type systems
language design
0.011992
Subsequence References: First-Class Values for Substrings · ACM Trans. Program. Lang. Syst. 1992
Indexing and storage engines
b+-tree
0.011981
A Cost Model for the Internal Organization of B+-Tree Nodes · ACM Trans. Program. Lang. Syst. 1981
User interface design and tools
programming environments
0.011981
An editor-based programming support environment (abstract only) · CHI (2) 1981
User interface design and tools › authoring tools
text editor
0.011981
An editor-based programming support environment (abstract only) · CHI (2) 1981
Performance modeling and evaluation
cost modeling
0.011981
A Cost Model for the Internal Organization of B+-Tree Nodes · ACM Trans. Program. Lang. Syst. 1981
Indexing and storage engines › storage management
storage structures
0.011981
A Cost Model for the Internal Organization of B+-Tree Nodes · ACM Trans. Program. Lang. Syst. 1981

Methods — techniques the papers use, named apart from their topics

primitive operations on subsequence references · 0.0
YearPublicationVenuePosition
1992 Subsequence References: First-Class Values for Substrings
abstract
Arrays of characters are a basic data type in many programming languages, but strings and substrings are seldom accorded first-class status as parameters and return values. Such status would enable a routine that calls a search function to readily access context on both sides of a return value. To enfranchise substrings, this paper describes a new data type for substrings as a special case of one for general subsequences. The key idea is that values are not sequences or references to positions in sequences, but rather references to subsequences. Primitive operations on the data type are constants, concatenation, and four new functions— base , start , next , and extent —which map subsequence references to subsequence references. This paper informally presents the data type, demonstrates its convenience for defining search functions, and shows how it can be concisely implemented. Examples are given in Ness, a language incorporating the new data type, which is implemented as part of the Andrew User Interface System.
Wilfred J. Hansen
ACM Trans. Program. Lang. Syst.1
1981 An editor-based programming support environment (abstract only)
abstract
Users of interactive systems typically must deal with numerous interactive interfaces, including especially the text editor and the system command interpreter. Unfortunately, the various interfaces too often have differing and even conflicting conventions. This paper suggests that an enhanced text editor can serve as the interactive interface for most purposes. For example, consider the file directory instead of choosing among half a dozen or more system commands to view and modify it, the user can edit an image that represents the directory. Deletion, renaming, and movement to another directory are easily accomplished with ordinary editor commands. Other system commands can he supplanted by a mechanism of "creation sequences" for files. Rather than execute the creation sequence, the user simply asks to view the file resulting from it.To facilitate this form of interaction, the text editor must include some novel features. It must permit structured files; where the structure can be a field structure within records or a hierarchical structure between records. A suitable editor is sketched.
Wilfred J. Hansen
CHI (2)1
1981 A Cost Model for the Internal Organization of B+-Tree Nodes
Wilfred J. Hansen
ACM Trans. Program. Lang. Syst.1
1978 The Report on the Standard Hardware Representation for ALGOL 68
Wilfred J. Hansen, Hendrik Boom
Acta Informatica1
1978 A Predecessor Algorithm for Ordered Lists
Wilfred J. Hansen
Inf. Process. Lett.1