OPTIMAL ASSIGMENT OF COMPUTER STORAGE BY CHAIN DECOMPOSITION OF PARTIALLY ORDERED SETS

Abstract : To save storage, a program is usually written so that each variable assumes several values. As a result, a program is usually difficult to understand and prone to errors. For an important class of programs, it will be shown that they can be written with complete freedom in the naming of variables; leaving the task of minimizing storage requirements to the computer itself.