Thesis (M.S.)--Oregon State University, 1983. / Typescript (photocopy). Includes bibliographical references (leaves 120-123). Also available on the World Wide Web.

published_or_final_version / Computer Science / Master / Master of Philosophy

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: Maude; term rewriting; access control. Includes bibliographical references (leaves 36-37).

Thesis (M. Sc.)--Carleton University, 2001. / Includes bibliographical references (p. 111-116). Also available in electronic format on the Internet.

Thesis (M.S.)--University of Wisconsin--Madison, 1970. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Thesis (M. Phil.)--University of Hong Kong, 1990.

The applicative or functional language SASL is investigated from the point of view of an implementation. The aim is to determine and experiment with a run-time environment (SASL parallel machine) which incorporates parallelism so that constituent parts of a program (its sub-expressions) can be processed concurrently. The introduction of parallelism is characterised by two fundamental issues. The type of programs, referred to as parallel and the so called strategy of parallelism, employed by the parallel machine. The former concerns deriving a graph from the program text indicating the order in which things must be done and the notion of "worthwhile" parallelism. In order to obtain a parallel program the original (sequential) program is transformed and/or modified. Certain programs are found to be essentially sequential. Parallelism is expressed as call-by-parallel parameter passing mechanism and by a parallel conditional operator, suggesting speculative parallelism. The issue of the strategy of parallelism concerns the scheme under which a regime of SASL processors combine their effort in processing a parallel program. The objective being to shorten the length of computation carried out by the sequential machine on the initial program. The class of parallel programs seems to be non-trivial and it includes both non-numerical and numerical programs. The "speed-up" by appealing to parallelism for such programs is found to be substantial.

This thesis describes the design of a well mapped machine¹ for the language BCPL. Based on a generalized notion of stack machines the SLIM (Stack Language for Intermediate Machines) machine is described. As the acronym suggests, representation of BCPL programs in SLIM is in fact slim compared with other architectures. The utility of this measure for comparison with other architectures is discussed and some encouraging results presented. Apart from this result, some advance is made in the classical mode of porting BCPL programs. Normally the compiler produces OCODE from which INTCODE is generated. The BCPL SLIM compiler shortcuts this process by generating SLIM directly from the program tree thus dispensing with software corresponding to the OCODE to INTCODE translator. Translation of BCPL programs is thus simplified and speeded up. ¹by well mapped we mean that transformations in the high level language correspond closely to those in the low level machine representation. / Science, Faculty of / Computer Science, Department of / Graduate

The idea of obtaining a best approximation in some sense of a function gained considerable importance with the introduction of electronic computers. The Remez algorithm, which is known as the exchange method, is used in this paper to find the best approximating polynomial of a given degree for a real continuous function f(x) on a real finite interval (a,b). The comparison of such an algorithm written in the FORTRAN and the PL/I languages is the main purpose of this paper. A review of the approximation theory is made as well as a discussion of the steps in the programming process. The outstanding features used in the programs of the languages are pointed out and illustrated with examples taken from the programs. The accuracy of the results, the speed, and the storage requirements are analyzed. Also ideas of program organization are discussed.Ball State UniversityMuncie, IN 47306

Thesis (M. Sc. (Computer Science))--Rhodes University, 2006.