Skip to Main content Skip to Navigation
Conference papers

A Confluent Relational Calculus for Higher-Order Programming with Constraints

Abstract : We 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 11:12:34 PM
Last modification on : Tuesday, October 31, 2017 - 2:22:18 PM
Long-term archiving on: : Thursday, February 17, 2011 - 3:17:53 AM


Files produced by the author(s)


  • HAL Id : inria-00536826, version 1


Joachim Niehren, Gert Smolka. A Confluent Relational Calculus for Higher-Order Programming with Constraints. 1st International Conference on Constraints in Computational Logics, 1994, Munich, Germany. ⟨inria-00536826⟩



Record views


Files downloads