Section: New Results

The logic of nominal abstraction

Participant : Dale Miller.

In the paper [12] , Gacek, Miller, and Nadathur have developed a strong logic that allows strong forms of induction and co-induction in the presence of the $\nabla$ quantifier. This quantifier was introduced in earlier work by Miller and Tiu [50] where it was shown to provide declarative and flexible operational semantic specifications for a number of systems such as the $\lambda$-calculus and the $\pi$-calculus. The paper In the paper [12] introduces a generalization form of equality, called nominal abstraction, that permits natural specifications of predicates such as freshness. This paper provides the necessary meta theory (cut-elimination) for this new logic.