Publication details

Saarland University Computer Science

A Confluent Relational Calculus for Higher-Order Programming with Constraints

Joachim Niehren, Gert Smolka

1st International Conference on Constraints in Computational Logics, Vol. 845 of Lecture Notes in Computer Science, vol. 845, pp. 89--104, Springer-Verlag, 1994

We present the rho-calculus, a relational calculus parametrized with 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.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy