Calculating a functional module for binary search trees
- We formally derive a functional module for binary search trees comprising search, insert, delete, minimum and maximum operations. The derivation starts from an extensional specification that refers only to the multiset of elements stored in the tree. The search tree property is systematically derived as an implementation requirement.
Download full text files
Postprint
Statistics
Additional Services
| Author: | Walter Dosch, Bernhard MöllerGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-248411 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/24841 |
| ISSN: | 0302-9743OPAC |
| Parent Title (English): | Lecture Notes in Computer Science |
| Publisher: | Springer |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 1997 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2017/07/21 |
| Volume: | 1268 |
| First Page: | 267 |
| Last Page: | 284 |
| Note: | Implementation of functional languages: 8th international workshop, IFL '96, Bad Godesberg, Germany, September 16 - 18, 1996; selected papers |
| DOI: | https://doi.org/10.1007/3-540-63237-9_30 |
| 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: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
| Licence (German): |  Deutsches Urheberrecht |
