TY  - JOUR
A1  - Dosch, Walter
A1  - Möller, Bernhard
T1  - Calculating a functional module for binary search trees
T2  - Lecture Notes in Computer Science
N2  - 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.
Y1  - 1997
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/24841
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-248411
SN  - 0302-9743
N1  - Implementation of functional languages: 8th international workshop, IFL '96, Bad Godesberg, Germany, September 16 - 18, 1996; selected papers
VL  - 1268
SP  - 267
EP  - 284
PB  - Springer
ER  -