Zobrazeno 1 - 10
of 2 271
pro vyhledávání: '"name binding"'
Autor:
Ichikawa, Kazuhiro, Chiba, Shigeru
Publikováno v:
The Art, Science, and Engineering of Programming, 2017, Vol. 1, Issue 2, Article 15
User-defined syntax extensions are useful to implement an embedded domain specific language (EDSL) with good code-readability. They allow EDSL authors to define domain-natural notation, which is often different from the host language syntax. Nowadays
Externí odkaz:
http://arxiv.org/abs/1703.10861
Automata models for data languages (i.e. languages over infinite alphabets) often feature either global or local freshness operators. We show that Bollig et al.'s session automata, which focus on global freshness, are equivalent to regular nondetermi
Externí odkaz:
http://arxiv.org/abs/1603.01455
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Information and Computation June 2012 215:68-87
Publikováno v:
2023 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER).
Autor:
Kazunori Ueda, Alimujiang Yasen
Publikováno v:
IEICE Transactions on Information and Systems. :1126-1140
Publikováno v:
Jisuanji kexue yu tansuo, Vol 18, Iss 3, Pp 795-804 (2024)
Named data networking (NDN) is a novel network architecture that revolves around information-centric principles. In order to acquire global routing information within the network, typical NDN routing protocols rely on data synchronization mechanisms
Externí odkaz:
https://doaj.org/article/de317972d585458da17e31c51de54ecf
Autor:
Kazuhiro Ichikawa, Shigeru Chiba
User-defined syntax extensions are useful to implement an embedded domain specific language (EDSL) with good code-readability. They allow EDSL authors to define domain-natural notation, which is often different from the host language syntax. Nowadays
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::014b9c1e1e165d13b9afb3e61221e3aa
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662544570
FoSSaCS
FoSSaCS
Nominal sets are a convenient setting for languages over infinite alphabets, i.e.i¾źdata languages. We introduce an automaton model over nominal sets, regular nondeterministic nominal automata RNNA, which have a natural coalgebraic definition using
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39d14ba11d1194e0db95b0e7c0bf81b1
https://doi.org/10.1007/978-3-662-54458-7_8
https://doi.org/10.1007/978-3-662-54458-7_8