Norman Ramsey
ABSTRACT
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distributions form a monad, and the monadic definition leads to a simple, natural semantics for a stochastic lambda calculus, as well as simple, clean implementations of common queries. But the monadic implementation of the expectation query can be much less efficient than current best practices in probabilistic modeling. We therefore present a language of measure terms, which can not only denote discrete probability distributions but can also support the best known modeling techniques. We give a translation of stochastic lambda calculus into measure terms. Whether one translates into the probability monad or into measure terms, the results of the translations denote the same probability distribution.
- Appel,A drew W.1992.Compiling with Continuations Cambridge:Cambridge University Press. Google Scholar
Digital Library
- Arborg,Stefan.1985.E .cient algorithms for combinatorial problems o graphs with bounded decomposability. BIT 25(1):2-23. Google ScholarDigital Library
- Benveniste,Albert,Bernard C.Levy,Eric Fabre,and Paul Le Guernic.1995.A calculus of stochastic systems for the speci .cation,simulatio ,and hidde state estimatio of mixed stochastic/nonstochastic systems.Theoretical Computer Science 152(2):171 -217. Google ScholarDigital Library
- Charniak,Eugene.1993.Statistical Language Learning MIT Press. Google ScholarDigital Library
- Claessen,Koen and Joh Hughes.2000 (September). QuickCheck:a lightweight tool for random testing of Haskell programs.Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP'00), in SIGPLAN Notices 35(9):268 -279. Google ScholarDigital Library
- Davy,Olivier.1996.Type-directed partial evaluation.I Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages pages 242 -257,New York,NY. Google ScholarDigital Library
- Dechter,Ria.1996 (August).Bucket elimination:Auifying framework for probabilistic i ference.I Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI-96),pages 211 -219,Sa Francisco. Google ScholarDigital Library
- Giry,Michele.1981.A categorical approach to probability theory.I Banaschewski,Bernhard,editor,Categorical Aspects of Topology and Analysis Vol.915 of Lecture Notes In Mathematics pages 68-85.Springer Verlag.Google Scholar
- Gupta,Vieet,Radha Jagadeesan,a d Prakash Panangaden.1999 (January).Stochastic processes as concurrent constraint programs.I Conference Record of the 26th Annual ACM Symposium on Principles of Programming Languages pages 189 -202. Google ScholarDigital Library
- Hughes,Joh .1989 (April).Why functional programming matters.The Computer Journal 32(2):98 -107. Google ScholarDigital Library
- ____1995.The design of a pretty-printing library.I Jeurig, Johan and Erik Meijer,editors,Advanced Functional Programming Vol.925 of Lecture Notes in Computer Science Springer Verlag. Google ScholarDigital Library
- Jaakkola,Tommi S.and Michael I.Jordan.1999.Variational probabilistic i ference and the QMR-DT etwork.Journal of Artificial Intelligence Research 10:291 -322. Google ScholarDigital Library
- Jensen,Fin V.1996.An Introduction to Bayesian Networks New York:Springer. Google ScholarDigital Library
- Jones,Claire.1990 (July).Probabilistic Non-determinism PhD thesis,Department of Computer Science,University of Edi burgh.Also Laboratory for the Foundations of Computer Science technical report ECS-LFCS-90- 105.Available o line. Google ScholarDigital Library
- Jones,Claire and Gordo D.Plotkin.1989.A probabilistic powerdomain of evaluations.I Proceedings of the Fourth Annual IEEE Symposium On Logic In Computer Science pages 186 -195. Google ScholarDigital Library
- Jordan,Michael I.,editor.1998.Learning in Graphical Models Kluwer. Google ScholarDigital Library
- Koller,Daphne,David McAllester,and Avi Pfeffer.1997. Effective Bayesian inference for stochastic programs. In Fourteenth National Conference on Artificial Intelligence (AAAI),pages 740 -747. Google ScholarDigital Library
- Lauritzen,Ste .en L.and David J.Spiegelhalter.1988.Local computations with probabilities of graphical structures and their applicatio to expert systems.Journal of the Royal Statistical Society pages 157 -224.Google Scholar
- Lawvere,F.William.1962.The category of probabilistic mappings.Unpublished.Google Scholar
- Li,Zhaoyu and Bruce d 'Ambrosio.1994.Efficient inference in Bayes nets as a combinatorial optimization problem.International Journal of Approximate Reasoning 11(1):55 -81.Google Scholar
- Luger,George and Dan Pless.2001.A stochastic -calculus.Technical Report TR-CS-2001-04,Department of Computer Science,University of New Mexico.Google Scholar
- Mahoney,Suzanne M.a d Kathryn Blackmo d Laskey. 1998 (July).Constructing situation specific belief etworks.I Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI-98),pages 370 - 378.Morgan Kaufma . Google ScholarDigital Library
- Muggleton,Stephe .2001.Stochastic logic programs.Journal of Logic Programming Accepted subject to revision.Google Scholar
- Pearl,Judea.1988.Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference San Mateo, CA:Morgan Kaufma . Google ScholarDigital Library
- Pfeffer ,Avi.2001 (August).IBAL:A probabilistic rational programming language.I Seventeenth Interna-tional Joint Conference on Artificial Intelligence (IJ- CAI) ,pages 733-740,Seattle. Google ScholarDigital Library
- Pfeffer, Avi and Daphne Koller.2000 (July).Semantics and i ference for recursive probability models.I Proceedings of the 7th Conference on Artificial Intel l igence (AAAI-00),pages 538 -544,Menlo Park,CA. Google ScholarDigital Library
- Ramsey,Norma .1994 (September).Literate programmimng simplied.IEEE Software 11(5):97 -105. Google ScholarDigital Library
- Rudi ,Walter.1974.Real and Complex Analysis Series in Higher Mathematics.Second edition.New York: McGraw-Hill. Google ScholarDigital Library
- Saheb-Djahromi,N.1978 (September).Probabilistic LCF. In Winkowski, Jozef,editor,Proceedings of the 7th Symposium on Mathematical Foundations of Computer Science Vol.64of Lecture Notes in Computer Science pages 442 -451.Springer.Google Scholar
- ____.1980 (September).CPO 's of measures for o determinism.Theoretical Computer Science 12(1):19 -37.Google Scholar
- Smyth,Michael B.1983 (July).Power domains a d predicate transformers:A topological view.I Diaz,Josep, editor,Automata, Languages and Programming, 10th Colloquium (ICALP-83),Vol.154 of Lecture Notes in Computer Science pages 662 -675,Barcelona,Spain. Google ScholarDigital Library
- Wadler,Philip.1992 (January).The essence of fumctional programming (i vited talk).In Conference Record of the 19th Annual ACM Symposium on Principles of Programming Languages pages 1 -14.New York,NY: ACM Press. Google ScholarDigital Library
- Witte,IanH.,RadfordM.Neal,adJohnG.Cleary. 1987 (Ju e).Arithmetic codi g for data compression. Communications of the ACM 30(6):520 -540. Google ScholarDigital Library
- Zhang,Nevin L.and David Poole.1994.A simple approach to Bayesian etwork computations.I Tenth Biennial Canadian Artificial Intelligence ConferenceGoogle Scholar
- Stochastic lambda calculus and monads of probability distributions
Recommendations
Stochastic lambda calculus and monads of probability distributions
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distributions form a monad, and the monadic definition leads to a simple, natural ...
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus
Lambda abstraction algebras are designed to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the first-order logic; they are intended as an alternative to combinatory algebras in this regard. Like ...
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus
Lambda abstraction algebras are designed to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the first-order logic; they are intended as an alternative to combinatory algebras in this regard. Like ...
Comments