论文信息 - Divide and concer: Data structuring in applicative multiprocessing systems

Divide and concer: Data structuring in applicative multiprocessing systems

The conc representation of lists in implementations of applicative languages is introduced. This representation is based on an operator conc which supplements the usual cons, the representation itself being able to coexist with the conventional nested-pair representation. Advantages of the conc representation are presented which relate to multiprocessing and conventional systems. Qualitative comparison with other compact list representations is made. The conc representation exploits demand-driven evaluation and provides further justification for the “tagged data” approach.

Robert M. Keller

[1] Wilfred J. Hansen,et al. Compact list representation: definition, garbage collection, and system implementation , 1969, CACM.

[2] Robert M. Keller,et al. A loosely-coupled applicative multi-processing system* , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[3] Daniel G. Bobrow,et al. Compact Encodings of List Structure , 1979, TOPL.

[4] Richard D. Greenblatt,et al. LISP Machine Progress Report. , 1977 .

[5] Daniel P. Friedman,et al. CONS Should Not Evaluate its Arguments , 1976, ICALP.

[6] Philip Wadler,et al. Experience with an applicative string processing language , 1980, POPL '80.

[7] John W. Backus,et al. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[8] Robert M. Keller,et al. Hierarchical Analysis of a Distributed Evaluator , 1980 .

[9] Gilles Kahn,et al. The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[10] John McCarthy,et al. LISP 1.5 Programmer's Manual , 1962 .

[11] William H. Burge,et al. Recursive Programming Techniques , 1975 .

[12] Peter Henderson,et al. A lazy evaluator , 1976, POPL.

[13] Bharadwaj Jayaraman. Resource control in a demand-driven data-flow model , 1981 .