Workshop on Logic of Programs

Logic of Programs 1979: Logic of Programs pp 145-168 | Cite as

On the algorithmic theory of dictionaries

  • Amdrzej Salwicki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 125)


A class of algebraic structures called dictionaries is defined. Among the properties (axioms) of dictionaries we find the algorithmic property : for every s the program while empty(s) do s := delete(amember(s),s) terminates. Starting with this observation we define and develop the algorithmic theory of dictionaries ATD. We are proving the representation theorem: every dictionary structure is isomorphic to the family of all finite subsets of some set. The complexity of the set of theorems of various extensions of ATD can vary from a hiperarithmetical set to the complement of a recursively enumerable set.


Representation Theorem Priority Queue Algorithmic Logic Algorithmic Theory Abstract Data Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho,A.,Hopcroft,J.,Ullman,J., The design and analysis of computer algorithms, Addision-Wesley, 1974Google Scholar
  2. 2.
    Banachowski, L., An axioms approach to the theory of data structures, Bull.Acad.Pol.Sci.Ser.Math.Astr.Phys. 23(1975),315–323Google Scholar
  3. 3.
    Dańko,W., A criterion of undecidability of algorithmic theories, Proc.MFCS 80 Rydzyna in Lecture Notes on Comp.Sci.Springer, 1980Google Scholar
  4. 4.
    Engeler, E., Algorithmic properties of structures, Math.Systems Theory 1 (1967), 183–195Google Scholar
  5. 5.
    Engeler,E., On the solvability of algorithmic problems, in H.E.Rose and J.C.Shepherdson eds. Logic Colloquium 73 North-Holland, 1975, 231–251Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Guttag. J., Abstract data types ... CACM 20 (1977), 396–404Google Scholar
  8. 8.
    Hoare, C.A.R., Proof of correctness of data representation, Acta Informatica 1 (1972), 271–281Google Scholar
  9. 9.
    Kfoury,D., Comparing algebraic structures up to algorithmic equivalence in Proc. 1-st Coll.Aut.Lang.Program.North-Holland 1972Google Scholar
  10. 10.
    Kreczmar, A., Programmability in fields, Fundamenta Informaticae 1 (1977), 195–230Google Scholar
  11. 11.
    Knuth,D., The art of computer programming, vol.3, Addison-Wesley, 1973Google Scholar
  12. 12.
    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–59Google Scholar
  13. 13.
    Mazur,S., Computable analysis, Dissertationes Mathematicae 33 1963 PWN Publ. WarsawGoogle Scholar
  14. 14.
    Oktaba,H., On algorithmic theory of reference, manuscript,1979Google Scholar
  15. 15.
    Mirkowska, G., Algorithmic logic and its applications in the theory of programs. Fundamenta Informaticae 1 (1977) 1–17, 147–167Google Scholar
  16. 16.
    Mirkowska,G., Algorithmic logic with nondeterministic programs. Fundamenta Informaticae 3 (1980)Google Scholar
  17. 17.
    Bartol,W.M., The definition of the semantics of some instructions of a block structured language with type prefixing.Google Scholar
  18. 18.
    Salwicki,A., On algorithmic theory of stacks in Proc.MFCS 78 J.Winkowski ed. Lecture Notes on Comp.Sci. vol.64 452–461Google Scholar
  19. 19.
    Scott, D., Data types as lattices, SIAM J.Comp.5 (1976), 522–587Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Amdrzej Salwicki
    • 1
    • 2
  1. 1.Mathematical InstitutePolish Academy of SciencesWarsawPoland
  2. 2.Institute of InformaticsUniversity of WarsawWarsaw, PKiN 8 fl.Poland

Personalised recommendations