论文信息 - High Level Data Structure - the Grid

High Level Data Structure - the Grid

Grids are arrays that can have any shape: grid elements need not be connected to each other (e.g., a grid may be pyramid-like or two disjoint rectangular pieces). Programs using grids are smaller, semantically clearer, more general and easier to modify than programs that simulate non array-like shapes. We present a notation for specifying grids in PASCAL. Grids have been implemented as an extension to FORTRAN.

Narain H. Gehani

[1] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[2] Narain H. Gehani. Data types for very high level programming languages. , 1975 .

[3] Narain H. Gehani,et al. A new data structure — the grid , 1977 .

[4] Thomas A. Standish,et al. A Data Definition Facility for Programming Languages , 1967, Outstanding Dissertations in the Computer Sciences.

[5] Laminar free-surface flow into a vertical cylinder , 1975 .

[6] M. E. Clark,et al. Calculation of plane pulsatile flow past wall obstacles , 1974 .

[7] Mary Shaw,et al. Abstraction and Verification in Alphard: Introduction to Language and Methodology , 1976 .

[8] Narain H. Gehani,et al. Some ideas on data types in high-level languages , 1976, CACM.