A Confluent Relational Calculus for Higher-Order Programming with Constraints (1994)
| Venue: | Proc. 1st Int. Conference on Constraints in Computational Logics (CCL'94 |
| Citations: | 6 - 4 self |
BibTeX
@INPROCEEDINGS{Niehren94aconfluent,
author = {Joachim Niehren and Gert Smolka},
title = {A Confluent Relational Calculus for Higher-Order Programming with Constraints},
booktitle = {Proc. 1st Int. Conference on Constraints in Computational Logics (CCL'94},
year = {1994},
pages = {89--104},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We present the ae-calculus, a relational calculus parametrized with a logical constraint system. The ae-calculus provides for higherorder 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 ae-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. 1 Introduction We present the ae-calculus, a relational calculus parametrized by a logical constraint system. The ae-calculus provides for higher-order relational programming with first-order constraints. The ae-calculus captures interesting aspects of the concurrent constraint programming language Oz [3]. It is a minimalistic subcalculus of the Oz-Calculus [12] wh...
