Abstract
We develop a domain theory within nominal sets and present programming language constructs and results that can be gained from this approach. The development is based on the concept of orbit-finite subset, that is, a subset of a nominal sets that is both finitely supported and contained in finitely many orbits. This concept appears prominently in the recent research programme of Bojanczyk et al. on automata over infinite languages, and our results establish a connection between their work and a characterisation of topological compactness discovered, in a quite different setting, by Winskel and Turner as part of a nominal domain theory for concurrency. We use this connection to derive a notion of Scott domain within nominal sets. The functionals for existential quantification over names and `definite description' over names turn out to be compact in the sense appropriate for nominal Scott domains. Adding them, together with parallel-or, to a programming language for recursively defined higher-order functions with name abstraction and locally scoped names, we prove a full abstraction result for nominal Scott domains analogous to Plotkin's classic result about PCF and conventional Scott domains: two program phrases have the same observable operational behaviour in all contexts if and only if they denote equal elements of the nominal Scott domain model. This is the first full abstraction result we know of for higher-order functions with local names that uses a domain theory based on ordinary extensional functions, rather than using the more intensional approach of game semantics.
Supplemental Material
- URL http://www.citeulike.org/group/11951/.Google Scholar
- S. Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51: 1--77, 1991.Google Scholar
- S. Abramsky, D. R. Ghica, A. S. Murawski, C.-H. L. Ong, and I. D. B. Stark. Nominal games and full abstraction for the nu-calculus. In Proc. LICS 2004, pages 150--159. IEEE Computer Society Press, 2004. Google Scholar
Digital Library
- S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163 (2): 409--470, 2000. Google Scholar
Digital Library
- S. Abramsky and A. Jung. Domain theory. In Handbook of Logic in Computer Science, Volume 3. Semantic Structures, chapter 1. Oxford University Press, 1994. Google Scholar
Digital Library
- M. Bojanczyk, L. Braud, B. Klin, and S. Lasota. Towards nominal computation. In Proc. POPL 2012, pages 401--412. ACM Press, 2012. Google Scholar
Digital Library
- M. Bojanczyk, B. Klin, and S. Lasota. Automata with group actions. In Proc. LICS 2011, pages 355--364. IEEE Computer Society Press, 2011. Google Scholar
Digital Library
- M. Bojanczyk and S. Lasota. A machine-independent characterization of timed languages. In Proc. ICALP 2012, Part II, volume 7392 of LNCS, pages 92--103. Springer-Verlag, 2012. Google Scholar
Digital Library
- V. Ciancia and U. Montanari. Symmetries, local names and dynamic (de)-allocation of names. Information and Computation, 208 (12): 1349--1367, 2010. Google Scholar
Digital Library
- P.-L. Curien. Definability and full abstraction. In Computation, Meaning and Logic, Articles dedicated to Gordon Plotkin, volume 172 of ENTCS, pages 301--310. Elsevier, 2007. Google Scholar
Digital Library
- M. J. Gabbay. A study of substitution, using nominal techniques and Fraenkel-Mostowski sets. Theoretical Computer Science, 410 (12--13): 1159--1189, 2009. Google Scholar
Digital Library
- M. J. Gabbay. Foundations of nominal techniques: Logic and semantics of variables in abstract syntax. Bulletin of Symbolic Logic, 17 (2): 161--229, 2011.Google Scholar
Cross Ref
- M. J. Gabbay and V. Ciancia. Freshness and name-restriction in sets of traces with names. In Proc. FOSSACS 2011, volume 6604 of LNCS, pages 365--380. Springer-Verlag, 2011. Google Scholar
Digital Library
- M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13: 341--363, 2002.Google Scholar
Digital Library
- F. Gadducci, M. Miculan, and U. Montanari. About permutation algebras, (pre)sheaves and named sets. Higher-Order Symb. Computation, 19: 283--304, 2006. Google Scholar
Digital Library
- J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. Information and Computation, 163 (2): 285--408, 2000. Google Scholar
Digital Library
- P. T. Johnstone. Sketches of an Elephant, A Topos Theory Compendium, Volumes 1 and 2. Number 43--44 in Oxford Logic Guides. Oxford University Press, 2002.Google Scholar
- J. Laird. A game semantics of names and pointers. Annals of Pure and Applied Logic, 151 (2): 151--169, 2008.Google Scholar
Cross Ref
- S. Lösch and A. M. Pitts. Relating Two Semantics of Locally Scoped Names. In Proc. CSL 2011, volume 12 of Leibniz International Proceedings in Informatics (LIPIcs), pages 396--411, 2011.Google Scholar
- G. Markowsky. Chain-complete p.o. sets and directed sets with applications. Algebra Universalis, 6: 53--68, 1976.Google Scholar
Cross Ref
- E. Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90--113, Department of Computer Science, University of Edinburgh, 1989.Google Scholar
- U. Montanari and M. Pistore. π-Calculus, structured coalgebras and minimal HD-automata. Proc. MFCS 2000, volume 1893 of phLNCS, pages 569--578. Springer-Verlag, 2000. Google Scholar
Digital Library
- A. S. Murawski and N. Tzevelekos. Algorithmic games for full ground references. In Proc. ICALP 2012, Part II, volume 7392 of LNCS, pages 312--324. Springer-Verlag, 2012. Google Scholar
Digital Library
- M. Odersky. A functional theory of local names. In Proc. POPL 1994, pages 48--59. ACM Press, 1994. Google Scholar
Digital Library
- A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186: 165--193, 2003. Google Scholar
Digital Library
- A. M. Pitts. Alpha-structural recursion and induction. Journal of the ACM, 53: 459--506, 2006. Google Scholar
Digital Library
- A. M. Pitts. Structural recursion with locally scoped names. Journal of Functional Programming, 21 (3): 235--286, 2011. Google Scholar
Digital Library
- A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. MPC 2000, volume 1837 of LNCS, pages 230--255. Springer-Verlag, 2000. Google Scholar
Digital Library
- A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? MFCS 1993, volume 711 of LNCS, pages 122--141. Springer-Verlag, 1993. Google Scholar
Digital Library
- G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5: 223--255, 1977.Google Scholar
Cross Ref
- F. Pottier. Static name control for FreshML. LICS 2007, pages 356--365. IEEE Computer Society Press, 2007. Google Scholar
Digital Library
- D. S. Scott. Domains for denotational semantics. ICALP 1982, volume 140 of phLNCS, pages 577--613. Springer-Verlag, 1982. Google Scholar
Digital Library
- M. R. Shinwell. The Fresh Approach: Functional Programming with Names and Binders. PhD thesis, University of Cambridge, 2005.Google Scholar
- M. R. Shinwell and A. M. Pitts. On a monadic semantics for freshness. Theoretical Computer Science, 342: 28--55, 2005. Google Scholar
Digital Library
- M. R. Shinwell, A. M. Pitts, and M. J. Gabbay. FreshML: Programming with binders made simple. ICFP 2003, pages 263--274. ACM Press, 2003. Google Scholar
Digital Library
- I. D. B. Stark. Names and Higher-Order Functions. PhD thesis, University of Cambridge, Dec. 1994.Google Scholar
- S. Staton. Name-Passing Process Calculi: Operational Models and Structural Operational Semantics. PhD thesis, University of Cambridge, 2007.Google Scholar
- T. Streicher. Domain-Theoretic Foundations of Functional Programming. World Scientific, Singapore, 2006. Google Scholar
Digital Library
- D. C. Turner. Nominal Domain Theory for Concurrency. PhD thesis, University of Cambridge, 2009.Google Scholar
- D. C. Turner and G. Winskel. Nominal domain theory for concurrency. CSL 2009, volume 5771 of LNCS, pages 546--560. Springer-Verlag, 2009. Google Scholar
Digital Library
- N. Tzevelekos. Nominal Game Semantics. PhD thesis, University of Oxford, 2008.Google Scholar
- N. Tzevelekos. Fresh-register automata. POPL 2011, pages 295--306. ACM Press, 2011. Google Scholar
Digital Library
- N. Tzevelekos. Program equivalence in a simple language with state. Computer Languages, Systems and Structures, 38 (2): 181--198, 2012. Google Scholar
Digital Library
Index Terms
Full abstraction for nominal Scott domains
Recommendations
Denotational Semantics with Nominal Scott Domains
When defining computations over syntax as data, one often runs into tedious issues concerning α-equivalence and semantically correct manipulations of binding constructs. Here we study a semantic framework in which these issues can be dealt with ...
Full abstraction for nominal Scott domains
POPL '13: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesWe develop a domain theory within nominal sets and present programming language constructs and results that can be gained from this approach. The development is based on the concept of orbit-finite subset, that is, a subset of a nominal sets that is ...
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 ...







Comments