Theoretical Computer Science
Journal of the ACM (JACM)
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
ACM Transactions on Computational Logic (TOCL)
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
History-dependent automata: an introduction
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
Toward model theory with data values
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Fraenkel-Mostowski sets with non-homogeneous atoms
RP'12 Proceedings of the 6th international conference on Reachability Problems
Full abstraction for nominal Scott domains
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of database-driven systems via amalgamation
Proceedings of the 32nd symposium on Principles of database systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Nominal sets are a different kind of set theory, with a more relaxed notion of finiteness. They offer an elegant formalism for describing lambda-terms modulo alpha-conversion, or automata on data words. This paper is an attempt at defining computation in nominal sets. We present a rudimentary programming language, called Nlambda. The key idea is that it includes a native type for finite sets in the nominal sense. To illustrate the power of our language, we write short programs that process automata on data words.