# Publication details

##
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

@INPROCEEDINGS{NS:CalculusHOCC94ccl,
title = {A Confluent Relational Calculus for Higher-Order Programming with Constraints},
author = {Joachim Niehren and Gert Smolka},
year = {1994},
month = {"7--9 " # sep},
editor = {"Jean-Pierre Jouannaud"},
publisher = {"Springer-Verlag"},
booktitle = {1st International Conference on Constraints in Computational Logics},
series = {{Lecture Notes in Computer Science, vol. 845}},
volume = {{845}},
pages = {"89--104"},
address = {"M{\"u}nchen, Germany"},
}

Login to edit

Webmaster,
Wed Sep 16 10:47:00 2009