However, for any point p on the manifold M and for any chart whose domain contains p, there is a convenient basis of the tangent space Tp(M). The third definition is also the most convenient one to… (More)

We attempt to elucidate the conditions required on Girard's candidates of reducibility (in French, "candidats de reductibilité ") in order to establish certain properties of various typed lambda… (More)

OBJECT/RELATIONAL QUERY OPTIMIZATION WITH CHASE AND BACKCHASE Lucian Popa Supervisor: Val Tannen Traditionally, query optimizers assume a direct mapping from the logical entities modeling the data… (More)

We give a proof that all terms that type-check in the theory of constructions are strongly normalizing (under-reduction). The main novelty of this proof is that it uses a \Kripke-like" interpretation… (More)

The correspondence between natural deduction proofs and λ-terms is presented and discussed. A variant of the reducibility method is presented, and a general theorem for establishing properties of… (More)

This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph… (More)

The purpose of this paper is to give an exposition of material dealing with constructive logics, typed -calculi, and linear logic. The first part of this paper gives an exposition of background… (More)

The clichéd popular description of topology as the branch of mathematics that equates doughnuts with coffee cups refers narrowly to a specialization, namely, the classification of manifolds, and more… (More)

This paper presents a kinematic model of the human arm in which the workspace of the elbow is modeled as a triangular B ezier spline surface. It is also explained how this model is used for solving… (More)