Result: About permutation algebras, (pre)sheaves and named sets
Title:
About permutation algebras, (pre)sheaves and named sets
Authors:
Source:
Second ACM SIGPLAN workshop MEchanized Reasoning about Languages with varIable and Names (MERΛIN 2003)Higher-order and symbolic computation. 19(2-3):283-304
Publisher Information:
Heidelberg: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 24 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Algèbre, Algebra, Catégories, algèbre homologique, Category theory, homological algebra, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Théorie programmation, Programming theory, Calcul symbolique, Symbolic computation, Cálculo simbólico, Construction, Construcción, Algèbre permutation, Permutation algebra, Calcul nominal, Nominal calculus, Catégorie préfaisceau, Presheaf category, Ensemble nommé, Named sets, Nominal calculi, Permutation algebras, Presheaf categories
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, University of Pisa, largo Pontecorvo 3c, 56127 Pisa, Italy
Department of Mathematics and Computer Science, University of Udine, viadelle Scienze 206, 33100 Udine, Italy
Department of Mathematics and Computer Science, University of Udine, viadelle Scienze 206, 33100 Udine, Italy
ISSN:
1388-3690
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.18084223
Database:
PASCAL Archive
Further Information
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)sheafcategories, 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.