Hypersequents are nite sets of ordinary sequents. We show that multiple-conclusion sequents and single-conclusion hypersequents represent two di erent natural methods of switching...
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
Abstract. This paper proposes two typing systems for session interactions in higherorder mobile processes. Session types for the HOπ-calculus capture high-level structures nicatio...