[T] he framework of ordinary sequents is not capable of handling all interesting logics. There
are logics with nice, simple semantics and obvious interest for which no decent, cut-free …

It is with great pleasure that we are presenting to the community the second edition of this
extraordinary handbook. It has been over 15 years since the publication of the first edition …

We present the linear type theory λΠ⊸ &⊤ as the formal basis for LLF, a conservative
extension of the logical framework LF. LLF combines the expressive power of dependent …

The Curry-Howard isomorphism identifies proofs with typed/spl lambda/-calculus terms, and
correspondingly identifies propositions with types. We show how this isomorphism can be …

RT (Pn). So, RB (Pn)⊆ RT (Pn). Moreover, RB (P) is symmetric by definition, for any pre-
topology P. Hence it is a tolerance relation, because reflexivity is inherited by the pre …

This paper gives an overview of existing applications of Linear Logic (LL) to issues of
computation. Alter a substantial introduction to LL, it discusses the implications of LL to …

Proof theory of modal logics, though largely studied since the fifties, has always been a
delicate subject, the main reason being the apparent impossibility to obtain elegant, natural …

We define two non-idempotent intersection type systems for the linear substitution calculus,
a calculus with partial substitutions acting at a distance that is a computational interpretation …

By restriction of Felleisen's control operator F we obtain an operator Δ and a fully
compatible, Church-Rosser control calculus λ Δ enjoying a number of desirable properties. It …

We present λ→□, a concise formulation of a proof term calculus for the intuitionistic modal
logic S4 that is well-suited for practical applications. We show that, with respect to …