Author:
Kozen Dexter,Mamouras Konstantinos,Silva Alexandra
Publisher
Springer International Publishing
Reference14 articles.
1. Bojanczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Logical Methods in Computer Science 10(3) (2014)
2. Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: POPL 2013, pp. 457–468 (January 2013)
3. Fernández, M., Gabbay, M.J.: Nominal rewriting with name generation: abstraction vs. locality. In: PPDP 2005. ACM Press (July 2005)
4. Foster, N., Kozen, D., Milano, M., Silva, A., Thompson, L.: A coalgebraic decision procedure for NetKAT. In: POPL 2015, Mumbai, India, pp. 343–355 (January 2015)
5. Gabbay, M., Pitts, A.M.: A new approach to abstract syntax involving binders. In: LICS 1999, Trento, Italy, pp. 214–224 (July 1999)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Nominal Automata with Name Binding;Lecture Notes in Computer Science;2017
2. Equational Theories of Abnormal Termination Based on Kleene Algebra;Lecture Notes in Computer Science;2017
3. From urelements to Computation;IFIP Advances in Information and Communication Technology;2016