Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calc...
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...