Natural deduction and sequent typed lambda calculus.
Natural Numbers In Illative Combinatory Logic.
Nondeterminism and fully abstract models
Normal forms in the typed -calculus with tuple types
Normalisation of the theory of Cartesian closed categories and conservativity of extensions of
Normalisation of the Theory T of Cartesian Closed Categories and Conservativity of Extensions T[x] of T
Using an inductive definition of normal terms of the theory of Cartesian Closed Categories with a given graph of distinguished morphisms, we give a reduction free proof of the decidability of this theory. This inductive definition enables us to show via functional completeness that extensions of such a theory by new constants (“indeterminates”) are conservative.