Calculating a Functional Module for Binary Search Trees

W. Dosch; Björn Möller

doi:10.1007/3-540-63237-9_30

Calculating a Functional Module for Binary Search Trees

W. Dosch, Björn Möller

Institute of Software Engineering and Programming Languages

University of Kiel

Abstract

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.

Original language	English
Pages	267-284
Number of pages	8
DOIs	https://doi.org/10.1007/3-540-63237-9_30
Publication status	Published - 1997
Event	8th International Workshop on Implementation of Functional Languages - Bad Godesberg, Germany Duration: 16.09.1996 → 18.09.1996

Conference

Conference	8th International Workshop on Implementation of Functional Languages
Abbreviated title	IFL'96
Country/Territory	Germany
City	Bad Godesberg
Period	16.09.96 → 18.09.96

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/3-540-63237-9_30

Cite this

@conference{c1579750de1840b3abf7ee4acf7a067b,

title = "Calculating a Functional Module for Binary Search Trees",

abstract = "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.",

author = "W. Dosch and Bj{\"o}rn M{\"o}ller",

year = "1997",

doi = "10.1007/3-540-63237-9_30",

language = "English",

pages = "267--284",

note = "8th International Workshop on Implementation of Functional Languages ; Conference date: 16-09-1996 Through 18-09-1996",

}

TY - CONF

T1 - Calculating a Functional Module for Binary Search Trees

AU - Dosch, W.

AU - Möller, Björn

PY - 1997

Y1 - 1997

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.

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

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-84957692269&origin=inward&txGid=ae3bedf0d5b7dd29b0ccda40067d2f60

U2 - 10.1007/3-540-63237-9_30

DO - 10.1007/3-540-63237-9_30

M3 - Conference Papers

SP - 267

EP - 284

T2 - 8th International Workshop on Implementation of Functional Languages

Y2 - 16 September 1996 through 18 September 1996

ER -

Calculating a Functional Module for Binary Search Trees

Abstract

Conference

UN SDGs

Access to Document

Other files and links

Cite this