نتایج جستجو برای: convenient variety
تعداد نتایج: 304768 فیلتر نتایج به سال:
Journal:
:International Journal of Research in Engineering and Technology
2014
1996
G. A. Papadopoulos
The extended term graph rewriting formalism of MONSTR is described, together with some of its more important rigorously established properties, particularly regarding serialisability and acyclicity. This basis is used for giving a convenient description of the global runtime structure of a concurrent object oriented language. The formalism proves especially convenient for describing very precis...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید