Abstract
Basic concepts of insertion programming as a new technology of programming are proposed. An insertion program is constructed as a three-level system. The first level is represented by the text of the program in an extended action language. The second level is a function of unfolding agent expressions. The third level is represented by a function of unfolding insertions.
Similar content being viewed by others
REFERENCES
A. A. Letichevskii, Yu. V. “Computations in APS,” Theoretical Computer Science, 119, 145-171 (1993).
Yu. V. Kapitonova and A. A. Letichevskii, “Basic paradigms of programming,” Kibern. Sist. Anal., No. 6, 3-20 (1994).
J. A. Bergstra, A. Ponse, and S. A. Smolka (eds.), Handbook of Process Algebra, North-Holland, Amsterdam, (2001).
R. Milner, A Calculus of Communicating Systems, LNCS, 92 (1980).
R. Milner, “Calculi of synchrony and asynchrony,” Theor. Comp. Sci., 25, 267-310 (1983).
A. A. Letichevskii and D. R. Gilbert, “A general theory of action languages,” Kibern. Sist. Anal., No. 1, 16-36 (1998).
A. Letichevskii and D. Gilbert, “A model for interaction of agents and environments,” in: D. Bert, C. Choppy, and P. Moses (eds.), Recent Trends in Algebraic Development Techniques, LNCS, 1827 (1999), pp. 311-328.
Yu. V. Kapitonova, A. A. Letichevskii, and V. A. Volkov, “Deductive tools of an algebraic programming system,” Kibern. Sist. Anal., No. 1, 17-35 (2000).
D. Park, “Concurrency and automata on infinite sequences,” LNCS, 104, 167-183 (1981).
A. A. Letichevskii, Yu. V. Kapitonova, V. P. Kotlyarov, A. A. Letichevskii Jr., and V. A. Volkov, “Semantics of timed message sequence charts,” Kibern. Sist. Anal., No. 4, 3-14 (2002).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Letichevskii, A.A., Kapitonova, Y.V., Volkov, V.A. et al. Insertion Programming. Cybernetics and Systems Analysis 39, 16–26 (2003). https://doi.org/10.1023/A:1023812824070
Issue Date:
DOI: https://doi.org/10.1023/A:1023812824070