A Calculus for Probabilistic Languages

Proceedings of the 2003 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation

Volumn , Issue , 2003, Pages 38-49

  Park, Sungwoo ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Probabilistic calculus; Probabilistic language; Refinement type system

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER SOFTWARE; FUNCTION EVALUATION; PROBABILITY; SAMPLING; SEMANTICS;

PROBABILISTIC CALCULUS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0141762599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/604174.604180     Document Type: Conference Paper

References (19)

1. P. Bratley, B. Fox, and L. Schrage. A guide to simulation. Springer Verlag, 2nd edition, 1996.
2. R. Davies and F. Pfenning. Intersection types and computational effects. In ICFP-00, pages 198-208. ACM Press, 2000.
3. R. Davies and F. Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3), 2001.
4. A. Edalat and P. J. Potts. A new representation for exact real numbers. In Electronic Notes in Theoretical Computer Science, volume 6. Elsevier Science Publishers, 2000.
5. D. Fox, W. Burgard, F. Dellaert, and S. Thrun. Monte carlo localization: Efficient position estimation for mobile robots. In AAAI-99, pages 343-349. AAAI/MIT Press, 1999.
6. J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6(4):675-695, 1977.
7. V. Gupta, R. Jagadeesan, and P. Panangaden. Stochastic processes as concurrent constraint programs. In 26th ACM POPL, pages 189-202. ACM Press, 1999.
8. A. H. Jazwinski. Stochastic Processes and Filtering Theory. Academic Press, New York, 1970.
9. C. Jones. Probabilistic Non-Determinism. PhD thesis, Department of Computer Science, University of Edinburgh, 1990.
10. D. Koller, D. McAllester, and A. Pfeffer. Effective Bayesian inference for stochastic programs. In AAAI-97/IAAI-97, pages 740-747. AAAI Press, 1997.
11. D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328-350, 1981.
12. J. Maraist, M. Odersky, and P. Wadler. The call-by-need lambda calculus. Journal of Functional Programming, 8(3):275-317, 1998.
13. A. Pfeffer. IBAL: A probabilistic rational programming language. In IJCAI-01, pages 733-740. Morgan Kaufmann Publishers, 2001.
14. F. Pfenning and R. Davies. A judgmental reconstuction of modal logic. Mathematical Structures in Computer Science, 11(4):511-540, 2001.
15. D. Pless and G. Luger. Toward general analysis of recursive probability models. In UAI-01, pages 429-436. Morgan Kaufmann Publishers, 2001.
16. N. Ramsey and A. Pfeffer. Stochastic lambda calculus and monads of probability distributions. In 29th ACM POPL, pages 154-165. ACM Press, 2002.
17. N. Saheb-Djahromi. Probabilistic LCF. In Proceedings of the 7th Symposium on Mathematical Foundations of Computer Science, volume 64 of LNCS, pages 442-451. Springer, 1978.
18. S. Thrun. Probabilistic algorithms in robotics. AI Magazine, 21(4):93-109, 2000.
19. S. Thrun. Towards programming tools for robots that integrate probabilistic computation and learning. In ICRA-00. IEEE, 2000.