FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
From MaRDI portal
Recommendations
Cited in
(20)- Measure transformer semantics for Bayesian machine learning
- Extensional equality preservation and verified generic programming
- Functional programming through deep time: modeling the first complex ecosystems on earth
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Probabilistic programming language and its incremental evaluation
- Probabilistic modelling, inference and learning using logical theories
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- ``Keep definition, change category -- a practical approach to state-based system calculi
- Unifying theories of programming with monads
- Typed linear algebra for weigthed (probabilistic) automata
- On the correctness of monadic backward induction
- A probabilistic approach to the problem of automatic selection of data representations
- Towards a linear algebra of programming
- Effect polymorphism in higher-order logic (proof pearl)
- Effect polymorphism in higher-order logic (proof pearl)
- Fault-tolerant functional reactive programming (extended version)
- Probabilistic programming: a true verification challenge
- Models for machine learning and data mining in functional programming
- Friends with benefits. Implementing corecursion in foundational proof assistants
- Implementing a library for probabilistic programming using non-strict non-determinism
This page was built for publication: FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717305)