in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...