|
Descripción
|
|
|---|---|
| Nominal techniques are based on the idea of sets with a finitelysupported atoms-permutation action. We consider the idea of nominal renaming sets, which are sets with a finitelysupported atoms-renaming action; renamings can identify atoms, permutations cannot. We show that nominal renaming sets exhibit many of the useful qualities found in (permutative) nominal sets; an elementary sets-based presentation, inductive datatypes of syntax up to binding, cartesian closure, and being a topos. Unlike is the case for nominal sets, the notion of names-abstraction coincides with functional abstraction. Thus we obtain a concrete presentation of sheaves on the category of finite sets in the form of a category of sets with structure. | |
|
Internacional
|
Si |
|
Nombre congreso
|
Logic for Programming, Artificial Intelligence, and Reasoning - LPAR'08 |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Doha, Qatar |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-3-540-89438-4 |
|
DOI
|
|
|
Fecha inicio congreso
|
22/11/2008 |
|
Fecha fin congreso
|
27/11/2008 |
|
Desde la página
|
158 |
|
Hasta la página
|
173 |
|
Título de las actas
|
Proceedings of the 15th International Conference, LPAR 2008. |