FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell Export

@article{citeulike:3141951, abstract = {At the heart of functional programming rests the principle of referential transparency, which in particular means that a function f applied to a value x always yields one and the same value y=f(x). This principle seems to be violated when contemplating the use of functions to describe probabilistic events, such as rolling a die: It is not clear at all what exactly the outcome will be, and neither is it guaranteed that the same value will be produced repeatedly. However, these two seemingly incompatible notions can be reconciled if probabilistic values are encapsulated in a data type.}, address = {New York, NY, USA}, author = {Martin Erwi, G. and Steve Kollmansberge, R.}, citeulike-article-id = {3141951}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1114008.1114013}, citeulike-linkout-1 = {http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=358592}, citeulike-linkout-2 = {http://dx.doi.org/10.1017/S0956796805005721}, doi = {10.1017/S0956796805005721}, issn = {0956-7968}, journal = {Journal of Functional Programming}, keywords = {fp, haskell, probability}, month = {January}, number = {01}, pages = {21--34}, posted-at = {2009-10-30 18:21:06}, priority = {2}, publisher = {Cambridge University Press}, title = {FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell}, url = {http://dx.doi.org/10.1017/S0956796805005721}, volume = {16}, year = {2006} }

TY - JOUR ID - citeulike:3141951 L3 - citeulike-article-id:3141951 N2 - At the heart of functional programming rests the principle of referential transparency, which in particular means that a function f applied to a value x always yields one and the same value y=f(x). This principle seems to be violated when contemplating the use of functions to describe probabilistic events, such as rolling a die: It is not clear at all what exactly the outcome will be, and neither is it guaranteed that the same value will be produced repeatedly. However, these two seemingly incompatible notions can be reconciled if probabilistic values are encapsulated in a data type. IS - 01 JF - Journal of Functional Programming SN - 0956-7968 AD - New York, NY, USA EP - 34 TI - FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell PB - Cambridge University Press VL - 16 SP - 21 KW - fp KW - haskell KW - probability AU - Martin Erwi, G AU - Steve Kollmansberge, R PY - 2006/01// UR - http://dx.doi.org/10.1017/S0956796805005721 ER -