{"id":"W4414955533","doi":"10.1017/s0956796825100105","title":"Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq","year":2025,"lang":"en","type":"preprint","venue":"Journal of Functional Programming","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Nondeterministic algorithm; Bisimulation; Concurrency; Embedding; Monad (category theory); Coinduction; HOL; Denotational semantics; Leverage (statistics)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004945254,0.0005834709,0.0005894984,0.0017312,0.0009256564,0.003267737,0.00193739,0.001186985,0.00256393],"category_scores_gemma":[0.009357071,0.0006820562,0.001940183,0.001533555,0.003669572,0.008219514,0.003905118,0.002287837,0.0004487853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002106115,"about_ca_system_score_gemma":0.001444989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01125283,"about_ca_topic_score_gemma":0.009515032,"domain_scores_codex":[0.9968249,0.001268471,0.000297646,0.000504006,0.0007214156,0.0003836139],"domain_scores_gemma":[0.9945128,0.002945386,0.0005141674,0.001076209,0.0007043638,0.000247052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001584999,0.00004284674,0.002309551,0.0001222664,0.00003947242,0.000361342,0.001376276,0.06075443,0.002639371,0.9078394,0.001394971,0.02296166],"study_design_scores_gemma":[0.00003646515,0.00004109097,0.000359323,0.00008829538,0.00005405537,0.0001112645,0.0003324356,0.3251333,0.006360791,0.6489455,0.01848482,0.00005273786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02857248,0.0002592771,0.9664471,0.0005068477,0.0000615829,0.00007762242,0.0003730941,0.00175352,0.001948533],"genre_scores_gemma":[0.63214,0.0004455337,0.3620549,0.0003299892,0.0001183668,0.0002642429,0.0008036401,0.0005315958,0.003311736],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01125283,"threshold_uncertainty_score":0.02615327,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1625735914183837,"score_gpt":0.398653377644027,"score_spread":0.2360797862256433,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}