1. Blikle A.,Mazurkiewicz A., An algebraic approach to the theory of programs,algorithms,languages and recursiveness,Proc.Intern.Symp. and Summer School on MFCS,1972,CCPAS Reports 1972
2. Conway M.E.,Design of a separable-transition diagram compliler, Comm.ACM 6,July 1963,396–408
3. Harel D., Meyer A.R., Pratt V.R., Computability,and Completeness in Logics of programs, Proc. 9th Annual ACM Symposium on Theory of Computing, Boulder,Colorado, May 1977,261–268
4. Janicki R.,An algebraic approach to the theory of recursive coroutines,Fundamenta Informaticae 1,No 1 (1977),131–145
5. Mazurkiewicz A.,Recursive algorithms and formal languages,Bull.Ac. Pol.Sci.,Ser.Sci.Math.Astron.Phys., 20(1972),799–809