Functional combination

Authors:
Daniel P. Friedman;David S. Wise
Affiliations:
Computer Science Department, Indiana University, Bloomington, IN 47401, U.S.A.;Computer Science Department, Indiana University, Bloomington, IN 47401, U.S.A.
Venue:
Computer Languages
Year:
1978

Citing 3
Cited 2

Batched searching of sequential and tree structured files

ACM Transactions on Database Systems (TODS)
Recursive programming through table look-up

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

Aspects of Applicative Programming for Parallel Processing

IEEE Transactions on Computers
Compiling lambda-expressions using continuations and factorizations

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

The algebraic functional operation of combination is introduced as a programming tool. It has a practical semantic interpretation in building functions which return several results, especially when such functions are directly recursive. Example functions are given whose invocations build multiple results from single recursions, including a new algorithm for batch-probing binary search trees from an unordered list of keys which returns an ordered list of hits.