Application of s-finite kernels to program semantics #912
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
affeldt-aist
changed the title
3 tasks
affeldt-aist
force-pushed
the
prob_lang
branch
3 times, most recently
from
870c929 to
1a34645
Compare
affeldt-aist
force-pushed
the
prob_lang
branch
3 times, most recently
from
8dc09a2 to
6242813
Compare
1 task
affeldt-aist
force-pushed
the
prob_lang
branch
from
c4dd151 to
ce0b897
Compare
affeldt-aist
force-pushed
the
prob_lang
branch
2 times, most recently
from
e4c675f to
564ae22
Compare
affeldt-aist
force-pushed
the
prob_lang
branch
2 times, most recently
from
4a191b6 to
00feb59
Compare
affeldt-aist
force-pushed
the
prob_lang
branch
from
ed131a4 to
07defec
Compare
affeldt-aist
force-pushed
the
prob_lang
branch
3 times, most recently
from
cc2f275 to
5d96668
Compare
affeldt-aist
force-pushed
the
prob_lang
branch
2 times, most recently
from
5e78cea to
5aecc7f
Compare
affeldt-aist
force-pushed
the
prob_lang
branch
2 times, most recently
from
48c890c to
bfb2fc6
Compare
- binomial - uniform - generalize measure_and - change the order of binop & add pow - fix for mR - rewrite casino0 to casino1 Co-authored-by: Reynald Affeldt <[email protected]>
- also fix casino1
Co-authored-by: Reynald Affeldt <[email protected]>
- define beta_probability - proof beta_ge0
- add exp_beta
- rewrite casino01 - proved casino34' - casino34 (remain admit) - casino45 - add Normalize
- use change of variables from charge.v to prove lemma integral_beta_nat (wip) - beta_nat_bern_bern
- new version of Bernoulli - beta_nat_norm_sym - generic change variables - beta_nat_normE - cleaning
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR is an application of s-finite kernels to probabilistic programs.
(NB: an early version of this PR appeared as PR #749 which is scheduled for closing)
It provides a semantics, an intrinsically-typed syntax, and examples of verified programs.
The semantics and several examples are documented in https://dl.acm.org/doi/10.1145/3732291
[R. Affeldt, C. Cohen, A. Saito, Semantics of Probabilistic Programs Using s-Finite Kernels in Dependent Type Theory, ACM Trans. Probab. Mach. Learn, 2025] (which is a revised and extended version of a conference paper that was presented at CPP 2023 https://dl.acm.org/doi/10.1145/3573105.3575691).
Note that the hierarchy of kernels has been merged into master (see PR #896 and PR #1444)
The intrinsically-typed syntax and more examples are explained in [A. Saito, R. Affeldt, Experimenting with an Intrinsically-Typed Probabilistic Programming Language in Coq, APLAS 2023].
@CohenCyril @AyumuSaito