Programming Language Semantics using K - true concurrency through term graph rewriting-

被引：0

作者：

Serbanuta, Traian Florin ^{[1
]}

机构：

[1] Univ Alexandru Ioan Cuza Iasi, Iasi, Romania

来源：

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：2 / 3

页数：2

共 10 条

[1]

BARENDREGT HP, 1987, LECT NOTES COMPUT SC, V259, P141

[2]

Ehrig H., 1976, LNCS, V45, P284, DOI [10.1007/3-540-07854-1188, DOI 10.1007/3-540-07854-1188]

[3]

Habel A., 2001, Mathematical Structures in Computer Science, V11, P637, DOI 10.1017/S0960129501003425

[4]

Habel Annegret, 1987, LNCS, V332, P92

[5]

Kreowski H.-J., 1977, FCT 77, V56, P275

[6] MODULARITY IN NONCOPYING TERM REWRITING [J].

KURIHARA, M ;

OHUCHI, A .

[7] An overview of the K semantic framework [J].

Rosu, Grigore ;

Serbanuta, Traian Florin .

JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2010, 79 (06) :397-434

[8]

Rosu Grigore, 2003, LECT NOTES COURSE TA

[9]

Serbanuta Traian Florin, 2012, Graph Transformations. Proceedings 6th International Conference, ICGT 2012, P294, DOI 10.1007/978-3-642-33654-6_20

[10]

Serbanuta T.F., 2010, THESIS