arXiv (All)
open access
A Gradual Probabilistic Lambda Calculus
Probabilistic programming languages extend ordinary programming languages with the ability to sample values from probability distributions. Type systems can establish invariants of such programs, for instance by assigning to a program a distribution over types that specifies the probability of each
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Compositional Information Geometry of Probabilistic Programs#1343087
- Distribution-Aware Programming: Learning Specialized Solvers from Experience#1118572
- Lambda Calculus Models of Programming Languages#464650
- Extending the quantitative toolset for higher-order programming languages#124319
- Progress in Benchmarking Generics for Mathematical Computation#411118
Record · ID 1357139
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive