Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism

DOI10.1017/S1471068419000085zbMath1434.68062arXiv1905.07212OpenAlexW2954116336MaRDI QIDQ5108531

Finn Teegen, Sandra Dylus, Jan Christiansen

Publication date: 4 May 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.07212

zbMATH Keywords

probabilistic programmingnon-determinismlazinessfunctional logic programmingcall-time choice

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Logic programming (68N17)

Related Items

A functional account of probabilistic programming with possible worlds. Declarative pearl, Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism, Unnamed Item, PFLP

Uses Software

• Haskell
• KiCS2
• Church
• FACTORIE
• EasyCheck
• SmallCheck
• PAKCS
• FlatCurry
• CHR.js

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic (logic) programming concepts
• Evaluation strategies for functional logic programming
• Purely functional lazy non-deterministic programming
• An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
• On the implementation of the probabilistic logic programming language ProbLog
• Constraint-Based Inference in Probabilistic Logic Programs
• Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism
• Distributing probability over non-determinism
• FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell