Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
In this paper, we report on a study that was performed within the "Semantics of History" project on how descriptions of historical events are realized in different types...
Abstract. We study secure information flow in a stack based Typed Assembly Language (TAL). We define a TAL with an execution stack and establish the soundness of its type system ...
Eduardo Bonelli, Adriana B. Compagnoni, Ricardo Me...
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...