{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:43Z","timestamp":1725662983630},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540111603"},{"type":"electronic","value":"9783540386315"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-11160-3_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:38:10Z","timestamp":1330173490000},"page":"145-168","source":"Crossref","is-referenced-by-count":2,"title":["On the algorithmic theory of dictionaries"],"prefix":"10.1007","author":[{"given":"Amdrzej","family":"Salwicki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"5_CR1","unstructured":"Aho,A.,Hopcroft,J.,Ullman,J., The design and analysis of computer algorithms, Addision-Wesley, 1974"},{"key":"5_CR2","first-page":"315","volume":"23","author":"L. Banachowski","year":"1975","unstructured":"Banachowski, L., An axioms approach to the theory of data structures, Bull.Acad.Pol.Sci.Ser.Math.Astr.Phys. 23(1975),315\u2013323","journal-title":"Bull.Acad.Pol.Sci.Ser.Math.Astr.Phys."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Da\u0144ko,W., A criterion of undecidability of algorithmic theories, Proc.MFCS 80 Rydzyna in Lecture Notes on Comp.Sci.Springer, 1980","DOI":"10.1007\/BFb0022506"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01705528","volume":"1","author":"E. Engeler","year":"1967","unstructured":"Engeler, E., Algorithmic properties of structures, Math.Systems Theory 1 (1967), 183\u2013195","journal-title":"Math.Systems Theory"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Engeler,E., On the solvability of algorithmic problems, in H.E.Rose and J.C.Shepherdson eds. Logic Colloquium 73 North-Holland, 1975, 231\u2013251","DOI":"10.1016\/S0049-237X(08)71950-5"},{"key":"5_CR6","unstructured":"Goguen,J.A.,Thatcher,J.W.,Wagner,E.G., An initial algebra approach to the specification, correctness and implementation to abstract data types, IBM Resp.Rep.RC 6487 (1977)"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/359605.359618","volume":"20","author":"J. Guttag","year":"1977","unstructured":"Guttag. J., Abstract data types ... CACM 20 (1977), 396\u2013404","journal-title":"CACM"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C. A. R. R. Hoare","year":"1972","unstructured":"Hoare, C.A.R., Proof of correctness of data representation, Acta Informatica 1 (1972), 271\u2013281","journal-title":"Acta Informatica"},{"key":"5_CR9","unstructured":"Kfoury,D., Comparing algebraic structures up to algorithmic equivalence in Proc. 1-st Coll.Aut.Lang.Program.North-Holland 1972"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Kreczmar, A., Programmability in fields, Fundamenta Informaticae 1 (1977), 195\u2013230","DOI":"10.3233\/FI-1977-1113"},{"key":"5_CR11","unstructured":"Knuth,D., The art of computer programming, vol.3, Addison-Wesley, 1973"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/800233.807045","volume":"4","author":"B. M. Liskov","year":"1974","unstructured":"Liskov, B.M., Zilles, S.N., Programming with abstract data types, Proc.ACM SIGPLAN Symp. on Very High Level Languages SIGPLAN Notices 4 (1974), 50\u201359","journal-title":"Proc.ACM SIGPLAN Symp. on Very High Level Languages SIGPLAN Notices"},{"key":"5_CR13","unstructured":"Mazur,S., Computable analysis, Dissertationes Mathematicae 33 1963 PWN Publ. Warsaw"},{"key":"5_CR14","unstructured":"Oktaba,H., On algorithmic theory of reference, manuscript,1979"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1977-1102","volume":"1","author":"G. Mirkowska","year":"1977","unstructured":"Mirkowska, G., Algorithmic logic and its applications in the theory of programs. Fundamenta Informaticae 1 (1977) 1\u201317, 147\u2013167","journal-title":"Fundamenta Informaticae"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Mirkowska,G., Algorithmic logic with nondeterministic programs. Fundamenta Informaticae 3 (1980)","DOI":"10.3233\/FI-1980-3105"},{"key":"5_CR17","unstructured":"Bartol,W.M., The definition of the semantics of some instructions of a block structured language with type prefixing."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Salwicki,A., On algorithmic theory of stacks in Proc.MFCS 78 J.Winkowski ed. Lecture Notes on Comp.Sci. vol.64 452\u2013461","DOI":"10.1007\/3-540-08921-7_93"},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"Scott, D., Data types as lattices, SIAM J.Comp.5 (1976), 522\u2013587","journal-title":"SIAM J.Comp."}],"container-title":["Lecture Notes in Computer Science","Logic of Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-11160-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T20:17:31Z","timestamp":1640895451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-11160-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540111603","9783540386315"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-11160-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}