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

Institut für Softwaretechnik und Programmiersprachen

Christian-Albrechts Universität zu 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.

Originalsprache	Englisch
Seiten	267-284
Seitenumfang	8
DOIs	https://doi.org/10.1007/3-540-63237-9_30
Publikationsstatus	Veröffentlicht - 1997
Veranstaltung	8th International Workshop on Implementation of Functional Languages - Bad Godesberg, Deutschland Dauer: 16.09.1996 → 18.09.1996

Tagung, Konferenz, Kongress

Tagung, Konferenz, Kongress	8th International Workshop on Implementation of Functional Languages
Kurztitel	IFL'96
Land/Gebiet	Deutschland
Ort	Bad Godesberg
Zeitraum	16.09.96 → 18.09.96

UN SDGs

Dieser Output leistet einen Beitrag zu folgendem(n) Ziel(en) für nachhaltige Entwicklung

SDG 9 – Industrie, Innovation und Infrastruktur

Dokumente

10.1007/3-540-63237-9_30

Weitere Links

https://www.scopus.com/pages/publications/84957692269

Zitieren

@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/pages/publications/84957692269

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

Tagung, Konferenz, Kongress

UN SDGs

Dokumente

Weitere Links

Fingerprint

Zitieren