Reports and Technical Reports
Computable Real Analysis
(Monterey, California. Naval Postgraduate School, 1984-12); NPS52-84-024
We present a model of the real numbers that is completely finitistic. Every real number is represented by a finite structure-specifically, a finite sequence of symbols from a finite alphabet. All of the arithmetic operations ...
On the Validation of Computer Science Theories
(Monterey, California. Naval Postgraduate School, 1984-11); NPS52-84-021
We address normatively the demarcation problem for Computer Science: How can Computer Science research be conducted scientifically? First we attempt to delimit the subject matter of Computer Science, and conclude that it ...
The four forms of Ω
(Monterey, California. Naval Postgraduate School, 1984-12); NPS52-84-026
A view of object-oriented programming
(Monterey, California. Naval Postgraduate School, 1983-02); NPS-52-83-001
Applicative programming languages and languages for data-flow machines are often described as value-oriented languages. Other languages, such a Smalltalk, are described as object-oriented. LISP has been described as both ...
Values and objects in programming languages
(Monterey, California. Naval Postgraduate School, 1981-04); NPS-52-81-006
The terms value-oriented and object-oriented are used to describe both programming languages and programming styles. This paper will describe the differences between values and objects and to show that their proper ...
The structural analysis of programming languages
(Monterey, California. Naval Postgraduate School, 1981-09); NPS-52-81-009
A language's structures are some of its most important characteristics. These include the data structures -- those mechanisms that the language provides for organizing elementary data values. They also include the control ...
A simple, natural notation for application languages
(Monterey, California. Naval Postgraduate School, 1982-09); NPS-52-82-009
Many non-specialists are intimidated by the mathematical appearance of most applicative, functional, and very-high-level languages. This report presents a simple notation that has an unintimidating, natural-language ...
A simple proof of a generalized Church-Rosser theorem
(Monterey, California. Naval Postgraduate School, 1984-06); NPS52-84-007
Abstract calculi (tree transformation systems, term rewriting systems) express computational processes by transformation rules operating on abstract structures (trees). They have applications to functional programming, ...
Simple metrics for programming languages
(Monterey, California. Naval Postgraduate School, 1982-10); NPS52-82-010
Several metrics for guiding the design and evaluation of programming languages are introduced. The objective is to formalize notions such as 'size', 'complexity', 'orthogonality', and 'simplicity'. Three different kinds ...
Relational programming
(Monterey, California. Naval Postgraduate School, 1983-09); NPS-52-83-012
This report describes relational programming , a style of programming in
which entire relations are manipulated as data, and in which programs are
represented as relations. The use of relational operators on both data ...
Refine By:
Author
Date Issued
Department
Type
-
Technical Report (33)