Hierarchies and relations among data types

The aim of this report is to show that, within the limits of what we know how to do efficiently with computers, it is possible to design a system of types that, to a good degree, models the conceptual hierarchies that we use in our everyday discourse. A method is presented for representing sets of objects by types and for representing relations among objects by relations among types. In the definition of types we can use variables (called formal variables) that range on types, and methods are provided for binding such variables to particular types. Types are either primitive, or formal variables, or obtained from types by the application of definitional operators. Relations are established among types to express that their instances have the same physial representation, or to express, possibly with additional requirements, that the set of instances of a type is a subset of the set of instances of another. These relations are used to assure that assignments and procedure calls preserve the membership of objects to the sets that are denoted by their types. By the use of formal variables we achieve the ability to abstract, in particular contexts, from details of objects

Reduction Algorithm for Zero-One Single Knapsack Problems

A simple algorithm is described for the reduction of 0-1 single knapsack problems to significantly smaller problems. The time required by the reduction algorithm is proportional to the number of variables. When used in conjunction with available algorithms for knapsack problems it substantially reduces total time and space requirements.