Nie jesteś zalogowany |
Nominal Computation
- Prelegent(ci)
- Mikołaj Bojańczyk
- Afiliacja
- Uniwersytet Warszawski
- Termin
- 11 maja 2011 14:15
- Pokój
- p. 5870
- Seminarium
- Seminarium „Teoria automatów”
I will present a programming language that manipulates nominal sets.
In the programming language, an orbit finite set behaves like a finite
set. One can execute in finite time a loop over all elements of an
orbit finite set, such as the rational numbers.
Using the programming language, one can write single piece of code,
which, when compiled by three different compilers, does the following
tasks:
1. test for emptiness an alternating automaton on finite words over a
finite alphabet.
2. test for emptiness a one-register alternating automaton on data
words, with data values compared for equality.
3. test for emptiness a one-register alternating automaton on data
words, with linearly ordered data values.
In the programming language, an orbit finite set behaves like a finite
set. One can execute in finite time a loop over all elements of an
orbit finite set, such as the rational numbers.
Using the programming language, one can write single piece of code,
which, when compiled by three different compilers, does the following
tasks:
1. test for emptiness an alternating automaton on finite words over a
finite alphabet.
2. test for emptiness a one-register alternating automaton on data
words, with data values compared for equality.
3. test for emptiness a one-register alternating automaton on data
words, with linearly ordered data values.
