Communication Dans Un Congrès Année : 1994

A Confluent Relational Calculus for Higher-Order Programming with Constraints

Résumé

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.

Fichier principal
Vignette du fichier
RhoCCL94.pdf (268.52 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

inria-00536826 , version 1 (16-11-2010)

Licence

Identifiants

  • HAL Id : inria-00536826 , version 1

Citer

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⟩
191 Consultations
436 Téléchargements

Partager

  • More