Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2014

Highly Cited

2014

We study languages over infinite alphabets equipped with some structure that
can be tested by recognizing automata. We develop a… Expand

Is this relevant?

2011

2011

We define Boolean algebras over nominal sets with a function-symbol И mirroring the И 'fresh name' quantifier (Banonas), and dual… Expand

Is this relevant?

2010

2010

Nominal terms extend first-order terms with binding. They lack some properties of first- and higher-order terms: Terms must be… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

In informal mathematical discourse (such as the text of a paper on theoretical computer science), we often reason about… Expand

Is this relevant?

2009

2009

Nominal logic is an extension of first-order logic with features useful for reasoning about abstract syntax with bound names. For… Expand

Is this relevant?

2008

2008

This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

This paper studies the notion of ''freshness'' that often occurs in the meta-theory of computer science languages involving… Expand

Is this relevant?

2006

2006

We introduce a mathematical structural operational semantics that yields a congruence result for bisimilarity and is suitable for… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

In this paper we define an inductive set that is bijective with the α-equated lambda-terms. Unlike de-Bruijn indices, however… Expand

Is this relevant?

2005

2005

This paper provides a solution to analyze semantic relations of Chinese nominal phrases. Firstly, it gives an introduction about… Expand

Is this relevant?