TY  - CHAP
A1  - Pepper, Peter
A1  - Möller, Bernhard
A2  - Broy, Manfred
T1  - Programming with (finite) mappings
N2  - We present a unified view of "mappings", abstracting from their appearance as "routines" (that is, objects that describe computations) or as "maplike data structures" (that is, objects that are stored and accessed via indices), respectively. On the basis of suitably defined algebraic operations we are then able to develop algorithms at a very high level of abstraction, without losing the potential of implementing them efficiently in terms of arrays and loops. This is demonstrated for a variety of array-based algorithms that are well-known from the literature.
Y1  - 1991
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/17065
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-170658
SN  - 978-3-642-76678-7
SP  - 381
EP  - 405
PB  - Springer
CY  - Berlin
ER  -