LEADER 03684nam  22005535  450 
001 996465589003316
005 20200705063646.0
010   $a3-540-46777-7
024 7 $a10.1007/BFb0016877
035   $a(CKB)1000000000233575
035   $a(SSID)ssj0000327104
035   $a(PQKBManifestationID)11266275
035   $a(PQKBTitleCode)TC0000327104
035   $a(PQKBWorkID)10298553
035   $a(PQKB)11265803
035   $a(DE-He213)978-3-540-46777-9
035   $a(PPN)155213342
035   $a(EXLCZ)991000000000233575
100   $a20121227d1990      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 12$aA Systematic Catalogue of Reusable Abstract Data Types$b[electronic resource] /$fby Jürgen Uhl, Hans A. Schmid
205   $a1st ed. 1990.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1990.
215   $a1 online resource (XIV, 344 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v460
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-53229-3 
327   $aMotivation and objectives -- How to reuse abstract data types -- Structure of the catalogue -- Structure of the building blocks -- The building blocks -- Technical issues -- Case study: A file compression system.
330   $aThis book presents a comprehensive catalogue of elementary data types like sets, maps, orders, trees and lists, written in Ada. Such data types are often used in systems programming. The major focus is on: - a uniform syntactic and semantic interface for all data types, - many implementation variants per data type, all ac cessible through a single interface, - a hierarchical system of the data types as a basis for data type selection and implementation. Meeting these goals is the main achievement of the book. The combination of efficient applicability and ease of learning and maintenance is achieved by the carefully elaborated interfaces of the catalogue's data types. These interfaces combine abstraction, which is necessary for easy learning and for leaving implementation freedom, and functional completeness, which is an essential prerequisite for high performance in different application contexts. The selection of the right data type implementation for a given context is supported by the data type hierarchy which imposes different abstraction levels, and an orthogonal scheme of implementation variants which can be freely combined. Together with the uniformity of interfaces, the hierarchical composition of the catalogue leads to a small code base, from which different implementation variants are generated using a macro processor.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v460
606   $aSoftware engineering
606   $aProgramming languages (Electronic computers)
606   $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
615  0$aSoftware engineering.
615  0$aProgramming languages (Electronic computers).
615 14$aSoftware Engineering.
615 24$aProgramming Languages, Compilers, Interpreters.
676   $a005.7/3
700   $aUhl$b Jürgen$4aut$4http://id.loc.gov/vocabulary/relators/aut$0736355
702   $aSchmid$b Hans A$4aut$4http://id.loc.gov/vocabulary/relators/aut
906   $aBOOK
912   $a996465589003316
996   $aA Systematic Catalogue of Reusable Abstract Data Types$92831786
997   $aUNISA