Skip to main content Accessibility help
×
Home

FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell

  • MARTIN ERWIG (a1) and STEVE KOLLMANSBERGER (a1)

Extract

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.

Copyright

Related content

Powered by UNSILO

FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell

  • MARTIN ERWIG (a1) and STEVE KOLLMANSBERGER (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell

  • MARTIN ERWIG (a1) and STEVE KOLLMANSBERGER (a1)
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *