Psi-calculi constitute a parametric framework for nominal process calculi, where constraint based process calculi and process calculi for mobility can be defined as instances. We apply here the framework of psi-calculi to provide a foundation for the exploration of declarative event-based process calculi with support for runtime refinement. We first provide a representation of the model of fini...

Abstract We introduce labelled sequent calculi for quantified modal logics with definite descriptions. prove that these have the good structural properties of G3-style calculi. In particular, all rules are height-preserving invertible, weakening and contraction admissible cut is syntactically admissible. Finally, we show each calculus gives a proof-theoretic characterization validity in corresp...

The catch/throw mechanism in Common Lisp provides a simple control mechanism for non-local exit. We study typed calculi by Nakano and Sato which formalize the catch/throw mechanism. These calculi correspond to classical logic through the Curry-Howard isomorphism, and one of their characteristic points is that they have nondeterministic reduction rules. These calculi can represent various comput...