Throughout his career as an electrical engineer and computer scientist, Stephen Lee Squires focused on the most challenging national security problems created by advanced information technologies and he had early access to the full range of those technologies as they emerged, such as early interactive time sharing systems with graphics, Unix, the Arpanet, extensible programming systems, local area networks, the early Internet, personal computing, VLSI design, rapid prototyping, and the highest performance information system technologies. Born in Philadelphia on December 27, 1947, Squires was a member of Phi Kappa Phi, Tau Beta Pi, and Eta Kappa Nu. He was awarded early admission to Drexel University, and received his BSEE with high honors. He won two National Science Foundation Graduate Scholarships at Princeton (Master's degree), and another at Harvard (PhD). He was regularly a member of both IEEE and ACM, including various special interest groups in each organization. Dr. Squires passed away April 26, 2019. In an obituary by his colleagues, they "acknowledge[d] his remarkable contributions to advancing computer science in the interests of national security. He sought societal benefits and impacts, and achieved both, serving his country largely out of the public eye...He led efforts advancing modern parallel computer architecture and associated Unix-based systems software, with lasting influences on the design of modern large-scale computing. [He] understood technical trends often before they were noticed by others, and also played a key role in creating new trends... [He] stimulated his colleagues to be creative and aggressive in taking on the most challenging problems in computing and national security."
<p>At the end of September 1969 I began to study some recent work on finite tree automata and tree transducers. I was also conerned with another kind of tree-manipulating system: formal computations in McCarthy's calculus for recursive definitions. Recursively defined functions were obviously single-valued, even in versions of the calculus that allowed much more freedom than the original one in deciding which formal procedure call to evaluate next, yet a rigorous proof was strangely elusive.</p>
<p style="text-align: left;">There exist mutually divisible nonisomorphic semigroups. A simple proof of this fact is given. Also, countable semigroups which are dvisible by every countable semigroup are characterized.</p>
<p>The GENRAP System can be viewed as serving two functions: the first being the development of a programming language; and the second being the construction of a translator for a programming language. These two functions are by no means mutually exclusive in that the method of translation may impose restrictions upon the language, and vice versa, but each function requires very different methods of operation.</p>
<p>Third edition: This edition of the NICOL manual represents a complete revision of the First Edition. Topics included here but not in the first edition are type-conversion and truncation guidance functions, expression evaluation, procedure blocks, and routines.</p>
<p>This document discusses the syntaxt descriptive language "BNF," the generation strategy language "GSL," and the manner in which each of these languages is used within the Compiler Generator System. </p>
<p>This document is a textbook designed to teach programmers to write translator descriptions in BNFGSL. Effort has been expended to make the textbook simple, redundant, and free from irrelevant formal remarks, no matter how interesting. It is our hope that the price paid in prolixity will be returned in ease of assimilation by readers with very little experience in systems programming.</p>
<p>This document is intended to be an informal, but complete, description of the TRANDIR language. It is hoped that, due to the informal nature of this description, it will prove useful as a reference document.</p>
<p>Languages providing dynamic storage allocation usually provide for the automatic reclamation of unused storage by garbage collection... In its simplest form, a garbage collector reclaims unused storage while leaving objects in situ i.e., in the same memory locations.</p>
<p>In constructing a general purpose programing language, a key issue is providing a sufficient set of data types and associated operations in a manner that permits both natural problem-oriented notation and very efficient implementation. The language EL1 contains a number of features specifically designed to simultaneously satisfy both requirements. The resulting treatment of data types includes provision for programmer-conversion, and very flexible data type behavior, in a context that allows efficient compiled code and very compact data represebtation.</p>
<p>Table of Contents:</p>
<p>Extensible language-- where are we going (Cheatham)</p>
<p>An overview of the ECL programming system (Wegbreit)</p>
<p>Interpreter/ compiler integration in ECL (Holloway)</p>
<p>An implementation of ECL data types (Brosgol)</p>
<p>The control structure facilities of ECL (Prenner)</p>