https://hal.inria.fr/inria-00536826Niehren, JoachimJoachimNiehrenProgramming Systems Lab [Saarland] - Saarland University [Saarbrücken]Smolka, GertGertSmolkaProgramming Systems Lab [Saarland] - Saarland University [Saarbrücken]A Confluent Relational Calculus for Higher-Order Programming with ConstraintsHAL CCSD1994[INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]Niehren, JoachimJean-Pierre Jouannaud2010-11-16 23:12:342017-10-31 14:22:182010-11-18 16:58:29enConference papersapplication/pdf1We present the rho-calculus, a relational calculus parametrized by a logical constraint system. The rho-calculus provides for higher-order relational programming with first-order constraints, and subsumes higher-order functional programming as a special case. It captures important aspects of the concurrent constraint programming language Oz. We prove the uniform confluence of the rho-calculus. Uniform confluence implies that all maximal derivations issuing from a given expression have equal length. But even confluence of a nonfunctional calculus modelling computation with partial information is interesting on its own right.