FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell

DOI10.1017/S0956796805005721MaRDI QIDQ5717305zbMATH OpenOpenAlexFDO

Authors Martin Erwig, Steve Kollmansberger

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)

Recommendations

• Implementing a library for probabilistic programming using non-strict non-determinism
• Purely functional lazy non-deterministic programming
• Unifying theories of programming with monads
• Purely functional lazy nondeterministic programming
• Probabilistic programming: a true verification challenge

Cited in

(21)

• PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
• Towards a linear algebra of programming
• A functional account of probabilistic programming with possible worlds. Declarative pearl
• A probabilistic approach to the problem of automatic selection of data representations
• Typed linear algebra for weigthed (probabilistic) automata
• Friends with benefits. Implementing corecursion in foundational proof assistants
• ``Keep definition, change category -- a practical approach to state-based system calculi
• Probabilistic programming language and its incremental evaluation
• Unifying theories of programming with monads
• Probabilistic programming: a true verification challenge
• Models for machine learning and data mining in functional programming
• Extensional equality preservation and verified generic programming
• On the correctness of monadic backward induction
• Implementing a library for probabilistic programming using non-strict non-determinism
• Fault-tolerant functional reactive programming (extended version)
• Functional programming through deep time: modeling the first complex ecosystems on earth
• Some lattice-based scientific problems, expressed in Haskell
• Measure transformer semantics for Bayesian machine learning
• Effect polymorphism in higher-order logic (proof pearl)
• Effect polymorphism in higher-order logic (proof pearl)
• Probabilistic modelling, inference and learning using logical theories

Describes a project that uses

Uses Software

• Haskell

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)