FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell

DOI10.1017/S0956796805005721zbMath1091.68023OpenAlexW2140654465MaRDI QIDQ5717305

Publication date: 13 January 2006

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796805005721

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (16)

``Keep definition, change category -- a practical approach to state-based system calculi ⋮ Probabilistic modelling, inference and learning using logical theories ⋮ Unifying Theories of Programming with Monads ⋮ Probabilistic Programming Language and its Incremental Evaluation ⋮ Typed Linear Algebra for Weigthed (Probabilistic) Automata ⋮ A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism ⋮ Towards a linear algebra of programming ⋮ Fault-tolerant functional reactive programming (extended version) ⋮ Friends with Benefits ⋮ PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control ⋮ Effect polymorphism in higher-order logic (proof pearl) ⋮ Effect polymorphism in higher-order logic (proof pearl) ⋮ Measure Transformer Semantics for Bayesian Machine Learning ⋮ Extensional equality preservation and verified generic programming ⋮ On the correctness of monadic backward induction

Uses Software

Haskell

This page was built for publication: FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell