The SLam calculus is a typed -calculus that maintains security information as well as type information. The type system propagates security information for each object in four for...
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
We study multiple predicate learning in an empirical setting. Problems with existing inductive logic programming approaches in this setting are sketched and an empirical ILP syste...
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...