Output details
11 - Computer Science and Informatics
University of Leicester
Return to search
Output 0 of 0 in the submission
Output title
On nominal regular languages with binders
Type
E - Conference contribution
Name of conference/published proceedings
Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012
Volume number
7213 LNCS
Issue number
-
First page of article
255
ISSN of proceedings
0302-9743
Year of publication
2012
URL
-
Number of additional authors
2
Additional information
<10> A new class of languages on infinite alphabets is introduced by allowing name binders in words. This caters for a more precise representation of allocations/deallocation of resources in computations. For instance, and crucially, resource-sensitive negation brings in more expressive wrt traditional theories (like finite-memory or fresh-register automata). Interestingly, these results emerge by analogy with traditional language theory (eg Kleene theorem). This new approach opens a whole range of theoretical challenges currently under exploration. For example, in collaboration with Degano et al., Tuosto is currently applying this approach to model checking nominal context-free languages.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
