Probabilistic concurrent constraint programming: Towards a fully abstract model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 446-455

  Di Pierro, Alessandra ^a   Wiklicky, Herbert ^a  

^a CITY UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BANACH SPACES; COMPUTER PROGRAMMING; FIXED POINT ARITHMETIC; SEMANTICS; COMPUTATIONAL LINGUISTICS;

CONCURRENT CONSTRAINT PROGRAMMING; DENOTATIONAL SEMANTICS; FIXED POINT CONSTRUCTIONS; PROBABILISTIC CHOICES; PROBABILISTIC CONCURRENT CONSTRAINT PROGRAMMING; PROBABILISTIC CONSTRAINTS; RANDOMISED ALGORITHMS; SCHAUDER FIXED-POINT THEOREM;

CONSTRAINT THEORY;

EID: 84896771832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055794     Document Type: Conference Paper

References (13)

1. 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.
2. F. S. de Boer and M. Gabbrielli. Infinite Computations in Concurrent Constraint Programming. Electronic Notes in Theoretical Computer Science, 6:16, 1997.
3. F.S. de Boer and C. Palamidessi. A Fully Abstract Model for Concurrent Constraint Programming. In S. Abramsky and T.S.E. Maibaum, editors, TAP-SOFT/CAAP, Volume 493, pages 293-319. Springer Verlag, 1991.
4. 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.
5. 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.
6. C. M. Grinstead and J. L. Snell. Introduction to Probability. American Mathematical Society, Providence, Rhode Island, second revised edition, 1997.
7. V. Gupta, R. Jagadeesan, and V. A. Saraswat. Probabilistic concurrent constraint programming. In Proceedings of CONCUR 91. Springer Verlag, 1997.
8. Claire Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, Edingburgh, 1993.
9. Dexter Kozen. Semantics for probabilistic programs. Journal of Computer and System Sciences, 22:328-350, 1981.
10. 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.
11. 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.
12. N. Saheb-Djahromi. CPO's of measures for nondeterminism. Theoretical Computer Science, 12:19-37, 1980.
13. V. A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of concurrent constraint programming. In Proceedings of POPL, pages 333-353. ACM, 1991.