Higher-Order and Symbolic Computation

, Volume 19, Issue 2, pp 283–304

About permutation algebras, (pre)sheaves and named sets

Authors

    • Department of Computer ScienceUniversity of Pisa
  • Marino Miculan
    • Department of Mathematics and Computer ScienceUniversity of Udine
  • Ugo Montanari
    • Department of Computer ScienceUniversity of Pisa
Article

DOI: 10.1007/s10990-006-8749-3

Cite this article as:
Gadducci, F., Miculan, M. & Montanari, U. Higher-Order Symb Comput (2006) 19: 283. doi:10.1007/s10990-006-8749-3
  • 44 Views

Abstract

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.

Keywords

Nominal calculiPermutation algebrasPresheaf categoriesNamed sets
Download to read the full article text

Copyright information

© Springer Science + Business Media, LLC 2006