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.
Type de document :
Communication dans un congrès
Jean-Pierre Jouannaud. 1st International Conference on Constraints in Computational Logics, 1994, Munich, Germany. Springer, 845, 1994, Lecture Notes on Computer Science
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00536826
Contributeur : Joachim Niehren <>
Soumis le : mardi 16 novembre 2010 - 23:12:34
Dernière modification le : mardi 31 octobre 2017 - 14:22:18
Document(s) archivé(s) le : jeudi 17 février 2011 - 03:17:53

Fichiers

RhoCCL94.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00536826, version 1

Citation

Joachim Niehren, Gert Smolka. A Confluent Relational Calculus for Higher-Order Programming with Constraints. Jean-Pierre Jouannaud. 1st International Conference on Constraints in Computational Logics, 1994, Munich, Germany. Springer, 845, 1994, Lecture Notes on Computer Science. 〈inria-00536826〉

Partager

Métriques

Consultations de la notice

69

Téléchargements de fichiers

157