Divide and concer: Data structuring in applicative multiprocessing systems

Authors:
Robert M. Keller
Affiliations:
-
Venue:
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Year:
1980

Citing 5
Cited 5

Compact Encodings of List Structure

ACM Transactions on Programming Languages and Systems (TOPLAS)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Compact list representation: definition, garbage collection, and system implementation

Communications of the ACM
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

A three-processor Lisp machine architecture based on statistical analysis of Common Lisp programs

ACM SIGPLAN Notices
A Hybrid Scheme for Processing Data Structures in a Dataflow Environment

IEEE Transactions on Parallel and Distributed Systems
Static inference of properties of applicative programs

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A bibliography on multiprocessor Lisp systems and applications

ACM SIGPLAN Lisp Pointers
XML goes native: run-time representations for XTATIC

CC'05 Proceedings of the 14th international conference on Compiler Construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.