We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, paralle...