Results 1 
3 of
3
Orderenriched categorical models of the classical sequent calculus
 LECTURE AT INTERNATIONAL CENTRE FOR MATHEMATICAL SCIENCES, WORKSHOP ON PROOF THEORY AND ALGORITHMS
, 2003
"... It is wellknown that weakening and contraction cause naïve categorical models of the classical sequent calculus to collapse to Boolean lattices. Starting from a convenient formulation of the wellknown categorical semantics of linear classical sequent proofs, we give models of weakening and contra ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
(Show Context)
It is wellknown that weakening and contraction cause naïve categorical models of the classical sequent calculus to collapse to Boolean lattices. Starting from a convenient formulation of the wellknown categorical semantics of linear classical sequent proofs, we give models of weakening and contraction that do not collapse. Cutreduction is interpreted by a partial order between morphisms. Our models make no commitment to any translation of classical logic into intuitionistic logic and distinguish nondeterministic choices of cutelimination. We show soundness and completeness via initial models built from proof nets, and describe models built from sets and relations.
Varieties of effects
 In Foundations of Software Science and Computation Structures, volume 2303 of LNCS
, 2002
"... Abstract. We introduce the notion of effectoid as a way of axiomatising the notion of “computational effect”. Guided by classical algebra, we define several effectoids equationally and explore their relationship with each other. We demonstrate their computational relevance by applying them to global ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce the notion of effectoid as a way of axiomatising the notion of “computational effect”. Guided by classical algebra, we define several effectoids equationally and explore their relationship with each other. We demonstrate their computational relevance by applying them to global exceptions, partiality, continuations, and global state. 1
On Protection by Layout Randomization
"... Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programminglanguage terms. More specifically, we consider layout randomization as part of an implementation for a highlevel programming language; the implementation translates this ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programminglanguage terms. More specifically, we consider layout randomization as part of an implementation for a highlevel programming language; the implementation translates this language to a lowerlevel language in which memory addresses are numbers. We analyze this implementation, by relating lowlevel attacks against the implementation to contexts in the highlevel programming language, and by establishing full abstraction results. I.