Graduate School and University Center Archives Finding Aid - Record Group III: Periodicals

This is part of the finding aid to the Graduate School and University Center (GSUC) Archives. Record Group III is periodicals by and/or about the GSUC.

Graduate School and University Center Archives Finding Aid - Record Group II: Centers and Institutes

This is part of the finding aid to the Graduate School and University Center (GSUC) Archives, City University of New York. Record Group II is material collected from research centers and institutes at the GSUC.

Graduate School and University Center Archives Finding Aid - Record Group I: Subjects

This is part of the finding aid to the Graduate School and University Center (GSUC) Archives, City University of New York. Record Group I lists the subjects covered in the collection.

Nat Gold, Sheet Metal Graduate from the New York Trade School

Nat Gold graduated from the Sheet Metal program at the New York Trade School in 1942. He is represented here in the sheet metal shop he owns. Notice the blueprints for the White Plains Senior High School hanging on the wall behind him. Original caption reads, "Shop Owner, Brook Sheet Metal Inc. Nat Gold - Sheet Metal 1942, represents one of many Sheet Metal graduates who became owners of their own business." Black and white photograph.

Graduate Receiving Diploma at New York Trade School Commencement

A graduate from the New York Trade School is receiving his diploma from an administrator from the school. Black and white photograph.

Important Parameters in Designing and Presenting Exhibits and Planetarium Programs in Science Centers : A Visitor-Based Framework

This dissertation proposes an initial framework for designing and presenting exhibits in science centers and to recommend methods for improving the educational role of planetariums in science centers.

The Survivability of Swedish Emergency Management Related Research Centers and Academic Programs : A Preliminary Sociology of Science Analysis

The Survivability of Swedish Emergency Management Related Research Centers and Academic Programs: A Preliminary Sociology of Science Analysis Despite being a relatively safe nation, Sweden has four different universities supporting four emergency management research centers and an equal and growing number of academic programs. In this paper, I discuss how these centers and programs survive within the current organizational environment. The sociology of science or the sociology of scientific knowledge perspectives should provide a theoretical guide. Yet, scholars of these perspectives have produced no research on these related topics. Thus, the population ecology model and the notion of organizational niche provide my theoretical foundation. My data come from 26 interviews from those four institutions, the gathering of documents, and observations. I found that each institution has found its own niche with little or no competition – with one exception. Three of the universities do have an international focus. Yet, their foci have minimal overlap. Finally, I suggest that key aspects of Swedish culture, including safety, and a need aid to the poor, help explain the extensive funding these centers and programs receive to survive. 

Fred: An approach to generating real, correct, reusable programs from proofs

In this paper we describe our system for automatically extracting "correct" programs from proofs using a development of the Curry-Howard process. Although program extraction has been developed by many authors, our system has a number of novel features designed to make it very easy to use and as close as possible to ordinary mathematical terminology and practice. These features include 1. the use of Henkin's technique to reduce higher-order logic to many-sorted (first-order) logic; 2. the free use of new rules for induction subject to certain conditions; 3. the extensive use of previously programmed (total, recursive) functions; 4. the use of templates to make the reasoning much closer to normal mathematical proofs and 5. a conceptual distinction between the computational type theory (for representing programs)and the logical type theory (for reasoning about programs). As an example of our system we give a constructive proof of the well known theorem that every graph of even parity, which is non-trivial in the sense that it does not consist of isolated vertices, has a cycle. Given such a graph as input, the extracted program produces a cycle as promised.

Protocols between programs and proofs

In this paper we describe a new protocol that we call the Curry-Howard protocol between a theory and the programs extracted from it. This protocol leads to the expansion of the theory and the production of more powerful programs. The methodology we use for automatically extracting “correct” programs from proofs is a development of the well-known Curry-Howard process. Program extraction has been developed by many authors, but our presentation is ultimately aimed at a practical, usable system and has a number of novel features. These include 1. a very simple and natural mimicking of ordinary mathematical practice and likewise the use of established computer programs when we obtain programs from formal proofs, and 2. a conceptual distinction between programs on the one hand, and proofs of theorems that yield programs on the other. An implementation of our methodology is the Fred system. As an example of our protocol we describe a constructive proof of the well-known theorem that every graph of even parity can be decomposed into a list of disjoint cycles. Given such a graph as input, the extracted program produces a list of the (non-trivial) disjoint cycles as promised.

Extraction of structured programs from specification proofs

We present a method using an extended logical system for obtaining programs from specifications written in a sublanguage of CASL. These programs are “correct” in the sense that they satisfy their specifications. The technique we use is to extract programs from proofs in formal logic by techniques due to Curry and Howard. The logical calculus, however, is novel because it adds structural rules corresponding to the standard ways of modifying specifications: translating (renaming), taking unions, and hiding signatures. Although programs extracted by the Curry-Howard process can be very cumbersome, we use a number of simplifications that ensure that the programs extracted are in a language close to a standard high-level programming language. We use this to produce an executable refinement of a given specification and we then provide a method for producing a program module that maximally respects the original structure of the specification. Throughout the paper we demonstrate the technique with a simple example.