Nominal techniques are a range of techniques, based on nominal sets, for handling names and binding, e.g. in abstract syntax. Research into nominalâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Review

2016

Review

2016

- Andrew M. Pitts
- SIGLOG News
- 2016

Programming languages abound with features making use of names in various ways. There is a mathematical foundation for theâ€¦Â (More)

Is this relevant?

2015

2015

We examine the key syntactic and semantic aspects of a nominal framework allowing scopes of name bindings to be arbitrarilyâ€¦Â (More)

Is this relevant?

2012

2012

- Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
- Logical Methods in Computer Science
- 2012

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop aâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
- 2011 IEEE 26th Annual Symposium on Logic inâ€¦
- 2011

Our motivating question is a My hill-Nerode theorem for infinite alphabets. We consider several kinds of those: alphabets whoseâ€¦Â (More)

Is this relevant?

2011

2011

- Murdoch James Gabbay
- Bulletin of Symbolic Logic
- 2011

We are used to the idea that computers operate on numbers, yet another kind of data is equally important: the syntax of formalâ€¦Â (More)

Is this relevant?

2010

2010

- Gilles Dowek, Murdoch James Gabbay, Dominic P. Mulligan
- Logic Journal of the IGPL
- 2010

Nominal terms extend first-order terms with binding. They lack some properties of firstand higher-order terms: Terms must beâ€¦Â (More)

Is this relevant?

2009

2009

- Murdoch James Gabbay
- J. Log. Comput.
- 2009

Nominal algebra is a logic of equality developed to reason algebraically in the presence of binding. In previous work it has beenâ€¦Â (More)

Is this relevant?

2008

2008

- Temesghen Kahsai, Marino Miculan
- CiE
- 2008

The aim of this work is to obtain an interactive proof environment based on Isabelle/HOL for reasoning formally aboutâ€¦Â (More)

Is this relevant?

2008

2008

- Murdoch James Gabbay, Martin Hofmann
- LPAR
- 2008

Nominal techniques are based on the idea of sets with a finitelysupported atoms-permutation action. We consider the idea ofâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Christian Urban, Christine Tasson
- Journal of Automated Reasoning
- 2005

This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central toâ€¦Â (More)

Is this relevant?