1. Aho,A., Hopcroft,J., ullman,J., The design and analysis of computer algorithms, Addiaon-Wesley, 1974
2. Banachowski,L., On proving program correctness by means of stepwise refinement method, to appear in Proc. Symp. Algorithmic Logic and LOGLAN in Lecture Notes in Computer Science
3. Bartol,W.M.,et al., Report on the LOGLAN programming language Müldner, T., ed University of Warsaw 1981
4. Dańko,W., A criterion of undecidability of algorithmic theories, in Proc. MFCS'80 P.Dembinski ed. LNCS Springer Vlg vol.88
5. Engeler,E., Algorithmic properties of structures, Math. Systems Theory 1 (1967), 183–195