Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ronald D. Hubbard Jr.

dblp:58/10974 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1976
—ORCID · none

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

Systems, architecture and hardware · 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 · 91% Debugging and program repair · 9%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
extensibility
0.011976
Language extensibility and program design · DAC 1976
Programming languages and type systems
language design
0.011976
Language extensibility and program design · DAC 1976
Programming languages and type systems › language design
language extension
0.011976
Language extensibility and program design · DAC 1976
Debugging and program repair
program monitoring
0.011976
Language extensibility and program design · DAC 1976

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

microcode implementation · 0.0abstract data and operators · 0.0
YearPublicationVenuePosition
1976 Language extensibility and program design
abstract
The purpose of this paper is to define a method of adding extensibility to programming languages and to demonstrate the advantages of extensibility. The paper describes a method of adding ldquo;abstract data and operators” to a language. This aids in the design, debugging, monitoring, and optimization of the program. By allowing the programmer to use the data constructs which fit his problem, the design and coding of the algorithm are integrated. Effective monitoring of the code is accomplished by using the newly defined operator entry and exit points as probe points. After initial debugging, the program can be optimized without changing any code by improving the implementation of the data type representation and by implementing important operators in micro-code.
Ronald D. Hubbard Jr.
DAC1