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.
Supplemental Material
- P. Aziz Abdulla, J. Deneux, J. Ouaknine, and J. Worrell. Decidability and complexity results for timed automata via channel machines. In ICALP, pages 1089--1101, 2005. Google Scholar
Digital Library
- M. Bojanczyk. Data monoids. In STACS, 2011.Google Scholar
- M. Bojanczyk, B. Klin, and S. Lasota. Languages with group actions. In LICS, 2011.Google Scholar
- J. A. Brzozowski and E. L. Leiss. On equations for regular languages, finite automata, and sequential networks. Theor. Comput. Sci., 10:19--35, 1980.Google Scholar
Cross Ref
- A. K. Chandra, D. Kozen, and L. J. Stockmeyer. Alternation. J. ACM, 28(1):114--133, 1981. Google Scholar
Digital Library
- S. Demri and R. Lazic. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log., 10(3), 2009. Google Scholar
Digital Library
- G. L. Ferrari, U. Montanari, and M. Pistore. Minimizing transition systems for name passing calculi: A co-algebraic formulation. In FoSSaCS, volume 2303 of LNCS, pages 129--158, 2002. Google Scholar
Digital Library
- D. Figueira, P. Hofman, and S. Lasota. Relating timed and register automata. In Proc. EXPRESS'10, volume 41 of EPTCS, pages 61--75, 2010.Google Scholar
- R. Fraïssé. Theory of relations. North-Holland, 1953.Google Scholar
- N. Francez and M. Kaminski. Finite-memory automata. Theor. Comput. Sci., 134(2):329--363, 1994. Google Scholar
Digital Library
- M. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Asp. Comput., 13(3--5):341--363, 2002.Google Scholar
- S. Lasota and I. Walukiewicz. Alternating timed automata. In FoSSaCS, pages 250--265, 2005. Google Scholar
Digital Library
- S. Lasota and I. Walukiewicz. Alternating timed automata. ACM Trans. Comput. Log., 9(2), 2008. Google Scholar
Digital Library
- U. Montanari and M. Pistore. History-dependent automata: An introduction. In SFM, pages 1--28, 2005. Google Scholar
Digital Library
- J. Ouaknine and J. Worrell. On the decidability of metric temporal logic. In LICS, pages 188--197, 2005. Google Scholar
Digital Library
- M. Pistore. History Dependent Automata. PhD thesis, University of Pisa, 1999.Google Scholar
- M. R. Shinwell. The Fresh Approach: functional programming with names and binders. Technical Report UCAM-CL-TR-618, University of Cambridge, Computer Laboratory, February 2005.Google Scholar
- M. R. Shinwell and A. M. Pitts. Fresh Objective Caml user manual. Technical Report UCAM-CL-TR-621, University of Cambridge Computer Laboratory, February 2005.Google Scholar
Index Terms
Towards nominal computation
Recommendations
Towards nominal computation
POPL '12: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesNominal 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 ...
Permissive-nominal logic: First-order logic over nominal terms and sets
Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-formers can bind names in their arguments.
This allows for direct axiomatizations with binders, such as of the λ-binder of the lambda-calculus or the ∀-binder of ...
Nominal Techniques in Isabelle/HOL
This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that is bijective with the alpha-equated lambda-terms. Unlike de-Bruijn indices, however,...







Comments