Finitely presentable objects in ${\rm(}Cb\text{-}{\bf Sets}{\rm)}_{_{\rm fs}}$

Autor: Mahdieh Haddadi, Khadijeh Keshvardoost, Aliyeh Hosseinabadi

Publikováno v: Categories and General Algebraic Structures with Applications, Vol 21, Iss 1, Pp 175-209 (2024)

Pitts generalized nominal sets to finitely supported $Cb$-sets by utilizing the monoid $Cb$ of name substitutions instead of the monoid of finitary permutations over names. Finitely supported $Cb$-sets provide a framework for studying essential ideas

Externí odkaz: https://doaj.org/article/8dd3143103e2463594179ffbeffd4ad7

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Fast computations on ordered nominal sets

Autor: Venhoek, D., Moerman, J., Rot, J., Fischer, B.

Publikováno v: Fischer, B. (ed.), Theoretical Aspects of Computing – ICTAC 2018: 15th International Colloquium, Stellenbosch, South Africa, October 16–19, 2018, Proceedings, pp. 493-512
Theor. Comput. Sci., 935, 82-104. Elsevier
Theoretical Computer Science, 935, pp. 82-104
Theoretical Computer Science, 935, 82-104
Open Universiteit
Venhoek, D, Moerman, J & Rot, J 2022, ' Fast computations on ordered nominal sets ', Theor. Comput. Sci., vol. 935, pp. 82-104 . https://doi.org/10.1016/j.tcs.2022.09.002
Fischer, B. (ed.), Theoretical Aspects of Computing – ICTAC 2018: 15th International Colloquium, Stellenbosch, South Africa, October 16–19, 2018, Proceedings, 493-512. Cham : Springer International Publishing
STARTPAGE=493;ENDPAGE=512;ISSN=0302-9743;TITLE=Fischer, B. (ed.), Theoretical Aspects of Computing – ICTAC 2018: 15th International Colloquium, Stellenbosch, South Africa, October 16–19, 2018, Proceedings

Nominal automata are models for recognising languages over infinite alphabets, based on the algebraic notion of nominal set. Motivated by their use in automata theory, we show how to compute efficiently with nominal sets over the so-called total orde

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::639712b9c358129a07e775e344e43366
https://doi.org/10.1016/j.tcs.2022.09.002

Supported Sets - A New Foundation for Nominal Sets and Automata

Autor: Wißmann, Thorsten

Publikováno v: Klin, B. (ed.), CSL 2023: 31st EACSL Annual Conference on Computer Science Logic, University of Warsaw, Poland, February 13-16, 2023, pp. 38:1-38:19

The present work proposes and discusses the category of supported sets which provides a uniform foundation for nominal sets of various kinds, such as those for equality symmetry, for the order symmetry, and renaming sets. We show that all these diffe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61619be5f20906149f6e2481cd7edd16

A formalization of the nominal theory in Coq

Autor: Paranhos, Fabrício Sanches

Publikováno v: Biblioteca Digital de Teses e Dissertações da UFG
Universidade Federal de Goiás (UFG)
instacron:UFG

Nas implementações e análises de linguagens de programação é recorrente a necessidade de manipulação, ou demonstração, de termos contendo ligantes. Entretanto, na prática, esta não é uma tarefa trivial. Dentre os principais problemas pod

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3056::cd56b6ffbb762500d77dc28d34a59e51
http://repositorio.bc.ufg.br/tede/handle/tede/12314