Conference Proceeding

# Towards nominal computation.

Sigplan Notices - SIGPLAN 01/2012; DOI:10.1145/2103621.2103704 In proceeding of: Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, January 22-28, 2012
Source: DBLP

ABSTRACT 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.

0 0
·
0 Bookmarks
·
48 Views
• Source
##### Article: LTL with the Freeze Quantifier and Register Automata
[hide abstract]
ABSTRACT: A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. To reason about data words, linear temporal logic is extended by the freeze quantifier, which stores the element at the current word position into a register, for equality comparisons deeper in the formula. By translations from the logic to alternating automata with registers and then to faulty counter automata whose counters may erroneously increase at any time, and from faulty and error-free counter automata to the logic, we obtain a complete complexity table for logical fragments defined by varying the set of temporal operators and the number of registers. In particular, the logic with future-time operators and 1 register is decidable but not primitive recursive over finite data words. Adding past-time operators or 1 more register, or switching to infinite data words, cause undecidability.
11/2006;
• Source
##### Chapter: Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
[hide abstract]
ABSTRACT: We address the problem of minimizing labelled transition systems for name passing calculi. We show how the co-algebraic formulation of automata with naming directlysuggests an effective minimization algorithm which reduces the number of states to be analyzed in the verification of properties for name passing process calculi.
12/2001: pages 73-102;
• ##### Conference Proceeding: Relating timed and register automata
Proceedings 17th International Workshop on Expressiveness in Concurrency; 01/2010