Probabilistic concurrent constraint programming: Towards a fully abstract model
This paper presents a Banach space based approach towards a denotational semantics of a probabilistic constraint programming language. This language is based on the concurrent constraint programming paradigm, where randomness is introduced by means of a probabilistic choice construct. As a result, we obtain a declarative framework, in which randomised algorithms can be expressed and formalised. The denotational model we present is constructed by using functional-analytical techniques. As an example, the existence of fixed-points is guaranteed by the Brouwer-Schauder Fixed-Point Theorem. A concrete fixed-point construction is also presented which corresponds to a notion of observables capturing the exact results of both finite and infinite computations.
Unable to display preview. Download preview PDF.
- F. S. de Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and Infinite Computations in Constraint Programming. Theoretical Computer Science, 151(1), 1995. Selected Papers of the Workshop on Topology and Completion in Semantics, Chartres, France.Google Scholar
- F.S. de Boer and C. Palamidessi. A Fully Abstract Model for Concurrent Constraint Programming. In S. Abramsky and T.S.E. Maibaum, editors, TAPSOFT/CAAP, volume 493, pages 293–319. Springer Verlag, 1991.Google Scholar
- A. Di Pierro and H. Wiklicky. An operational semantics for Probabilistic Concurrent Constraint Programming. In P. Iyer, Y. Choo, and D. Schmidt, editors, ICCL'98 — International Conference on Computer Languages, pages 174-183. IEEE Computer Society and ACM SIGPLAN, IEEE Computer Society Press, May 1998.Google Scholar
- K. Goebel and W.A. Kirk. Topics in Metric Fixed Point Theory, volume 28 of Cambridge studies in advanced mathematics. Cambridge University Press, Cambridge, 1990.Google Scholar
- V. Gupta, R. Jagadeesan, and V. A. Saraswat. Probabilistic concurrent constraint programming. In Proceedings of CONCUR 97. Springer Verlag, 1997.Google Scholar
- Claire Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, Edingburgh, 1993.Google Scholar
- C. Morgan, A. McIver, K. Seidel, and J.W. Sanders. Probabilistic predicate transformers. Technical Report PRG-TR-4-95, Programming Research Group, Oxford University Computing Laboratory, 1995.Google Scholar
- S. O. Nyström and B. Jonsson. Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations. In D. Miller, editor, Proc. of the 1993 International Logic Programming Symposium, Series on Logic Programming, pages 335–352. The MIT Press, 1993.Google Scholar
- V. A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of concurrent constraint programming. In Proceedings of POPL, pages 333–353. ACM, 1991.Google Scholar