According to J.A.N. Lee in 1996, computer scientists “are reaching the stage of development where each new generation of participants is unaware both of their overall technological ancestry and the history of the development of their speciality, and have no past to build upon” [1, p.54]. A technically and historically accurate account, as attempted here, can help us, computer scientists, grasp ...

Hart, K.P. and J. van Mill, Discrete sets and the maximal totally bounded group topology, Journal of Pure and Applied Algebra 70 (1991) 73-80. If G is an Abelian group, then G # is G with its maximal totally bounded group topology. We prove that every A c G# contains a closed (in G#) and discrete subset B such that lB1 = IAl. This answers a question posed by Eric van Douwen. We also present an ...

REC (Regular Expression Compiler) is a concise programming language which allows students to write programs without knowledge of the complicated syntax of languages like FORTRAN and ALGOL. The language is recursive and contains only four elements for control. This paper describes an interpreter of REC written in FORTRAN.

The fully abstract games model of Reynolds’s Idealized Algol is adapted to provide a characterization of the language without the “bad variable constructor” mkvar. The model shows that the addition of mkvar to the language is conservative for observational equivalence but not for the observational preorder.

This is a description of the programming language Forsythe, which is a descendant of Algol 60 intended to be as uniform and general as possible, while retaining the basic character of its progenitor. This document supercedes Report CMU{CS{88{159, \Preliminary Design of the Programming Language Forsythe" 1].