About permutation algebras, (pre)sheaves and named sets

被引：35

作者：

Gadducci, Fabio ^{[1
]}

Miculan, Marino ^{[2
]}

Montanari, Ugo ^{[1
]}

机构：

[1] Department of Computer Science, University of Pisa, largo Pontecorvo 3c

[2] Department of Mathematics and Computer Science, University of Udine, viadelle Scienze 206

来源：

Higher-Order and Symbolic Computation | 2006年 / 19卷 / 2-3期

关键词：

Named sets; Nominal calculi; Permutation algebras; Presheaf categories;

D O I：

10.1007/s10990-006-8749-3

中图分类号：

学科分类号：

摘要：

In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)sheaf categories, nominal sets, permutation algebras and named sets, studying the relationships among these models, thus allowing techniques and constructions to be transferred from one model to the other. © Springer Science + Business Media, LLC 2006.

引用

页码：283 / 304

页数：21

共 19 条

[1]

Bucalo A., Hofmann M., Honsell F., Miculan M., Scagnetto I., Consistency of the theory of contexts, J. Funct. Progr., 16, pp. 327-395, (2006)

[2]

Corradini A., Heckel R., Montanari U., Compositional SOS and beyond: A coalgebraic view of open systems, Theor. Comp. Sci., 280, pp. 163-192, (2002)

[3]

Ferrari G., Montanari U., Pistore M., Minimizing transition systems for name passing calculi: A coalgebraic formulation, Lect. Notes in Comp. Sci., 2303, pp. 129-143, (2002)

[4]

Fiore M., Moggi E., Sangiorgi D., A fully abstract model for the π-calculus, Logic in Computer Science, pp. 43-54, (1996)

[5]

Fiore M., Staton S., Comparing operational models of name-passing process calculi, Electr. Notes in Theor. Comp. Sci., 106, (2004)

[6]

Fiore M., Turi D., Semantics of name and value passing, Logic in Computer Science, pp. 93-104, (2001)

[7]

Gabbay M.J., Pitts A.M., A new approach to abstract syntax with variable binding, Formal Aspects of Computing, 13, pp. 341-363, (2002)

[8]

Gadducci F., Miculan M., Montanari U., Some characterization results for permutation algebras, Electr. Notes in Theor. Comp. Sci., 104, (2004)

[9]

Hofmann M., Semantical analysis of higher-order abstract syntax, Logic in Computer Science, pp. 204-213, (1999)

[10]

Honsell F., Miculan M., Scagnetto I., An axiomatic approach to metareasoning on nominal algebras in HOAS, Lect. Notes in Comp. Sci., 2076, pp. 963-978, (2001)

← 1 2 →