Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
nominal sets
Description:
A mathematical framework for sets equipped with symmetries over atoms, used in logic, automata theory, and semantics.
Primary topic:
Logic, programming, and type systems (63%)
Related topics:
Logic, programming, and type systems (63%),
semigroups and automata theory (10%)
OpenAlex ID:
keywords/nominal-sets
Nominal logic, a first order theory of names and binding
2003
·
Andrew M. Pitts
·
Information and Computation
·
476
Nominal Sets: Names and Symmetry in Computer Science
2013
·
Andrew M. Pitts
·
Cambridge University Press eBooks
·
360
Curry-Style Types for Nominal Terms
2007
·
Maribel Fernández
, Murdoch J. Gabbay
·
Lecture notes in computer science
·
304
Automata theory in nominal sets
2014
·
Mikołaj Bojańczyk
, Bartek Klin
, et al.
·
Logical Methods in Computer Science
·
176
PDF
Nominal rewriting
2006
·
Maribel Fernández
, Murdoch J. Gabbay
·
Information and Computation
·
144
PDF
Alpha-structural recursion and induction
2006
·
Andrew M. Pitts
·
Journal of the ACM
·
125
Automata with Group Actions
2011
·
Mikolaj Bojanczyk
, Bartek Klin
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
98
Nominal (Universal) Algebra: Equational Logic with Names and Binding
2009
·
M. J. Gabbay
, A. Mathijssen
·
Journal of Logic and Computation
·
86
Coalgebraic Modal Logic Beyond Sets
2007
·
Bartek Klin
·
Electronic Notes in Theoretical Computer Science
·
82
PDF
Logical calculi for reasoning with binding
2007
·
Mathijssen, AHJ (Aad)
·
TU/e Research Portal
·
75
Nominal Equational Logic
2007
·
Ranald A. Clouston
, Andrew M. Pitts
·
Electronic Notes in Theoretical Computer Science
·
65
PDF
Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax
2011
·
Murdoch J. Gabbay
·
Bulletin of Symbolic Logic
·
64
A Presheaf Model of Parametric Type Theory
2015
·
Jean-Philippe Bernardy
, Thierry Coquand
, et al.
·
Electronic Notes in Theoretical Computer Science
·
63
PDF
Nominal abstraction
2010
·
Andrew Gacek
, Dale Miller
, et al.
·
Information and Computation
·
62
PDF
Nominal games and full abstraction for the nu-calculus
2004
·
Samson Abramsky
, Dan R. Ghica
, et al.
·
University of Birmingham Research Portal (University of Birmingham)
·
62
Nominal games and full abstraction for the nu-calculus
2004
·
S. Abramsky
, D.R. Ghica
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
59
PDF
About permutation algebras, (pre)sheaves and named sets
2006
·
Fabio Gadducci
, Marino Miculan
, et al.
·
LISP and Symbolic Computation
·
58
Nominal rewriting systems
2004
·
Maribel Fernández
, Murdoch J. Gabbay
, et al.
·
International Symposium on Principles and Practice of Declarative Programming (PPDP)
·
56
Turing Machines with Atoms
2013
·
Mikolaj Bojanczyk
, Bartek Klin
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
51
Towards nominal computation
2012
·
Mikolaj Bojanczyk
, Laurent Braud
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
46
Freshness and Name-Restriction in Sets of Traces with Names
2011
·
Murdoch J. Gabbay
, Vincenzo Ciancia
·
Lecture notes in computer science
·
45
PDF
Name-passing process calculi: operational models and structural operational semantics
2007
·
Sam Staton
·
CL Technical Reports
·
43
Towards nominal computation
2012
·
Mikolaj Bojanczyk
, Laurent Braud
, et al.
·
ACM SIGPLAN Notices
·
41
A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics
2006
·
M. Fiore
, S. Staton
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
38
Nominal Automata with Name Binding
2017
·
Lutz Schröder
, Dexter Kozen
, et al.
·
Lecture notes in computer science
·
37
PDF
Show more works
View as search
Works count:
324
Citation count:
4,301
Year
Topic
Type