Are anamorphisms reasonable abstractions?

  • In calculational derivations of pointer algorithms the concept of a reasonable abstraction function has proved to be of centralimportance. A function from pointer structures to some other domain is called reasonable if it only depends on the reachable part of the store. For reasonable functions we can reduce questions about invariance of certain parts of objects to an analysis of (non-)reachability in the pointer structure. In this way we can prove a number of transformation laws once and for all for all types of pointer structures. In the present paper we show that all abstraction functions with an anamorphic recursive definitionare reasonable, so that our laws apply for them. The approach copes also with cyclic strctures; among others, we give abstraction functionsfor cyclic lists and threaded trees. By tuning the degree of abstraction we can give simple specifications for routines that are to update pointer structures in situ.

Download full text files

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Bernhard MöllerGND
Frontdoor URL
Parent Title (English):WGP'98: Workshop on Generic Programming: Proceedings; 18. June 1998
Publisher:Chalmers Univ. of Technology
Place of publication:Marstrand
Editor:Roland Backhouse, Tim Sheard
Type:Conference Proceeding
Year of first Publication:1998
Publishing Institution:Universität Augsburg
Release Date:2017/07/21
Pagenumber:11 S.
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