Programming with (finite) mappings

  • 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.

Download full text files

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Peter Pepper, Bernhard MöllerGND
Frontdoor URL
Title Additional (German):Informatik und Mathematik: [Professor Dr. Dr. h.c. mult. F. L. Bauer zum 65. Geburtstag]
Place of publication:Berlin
Editor:Manfred Broy
Type:Part of a Book
Year of first Publication:1991
Publishing Institution:Universität Augsburg
Release Date:2017/07/21
First Page:381
Last Page:405
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Deutsches Urheberrecht