We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
We describe an interactive system to reconstruct 3D geometry and extract textures from a set of photographs taken with arbitrary camera parameters. The basic idea is to let the use...
Pierre Poulin, Mathieu Ouimet, Marie-Claude Frasso...
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...