Abstract. We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as th...
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...