act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...