{"id":"W2051749751","doi":"10.2168/lmcs-3(3:1)2007","title":"A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto; Deutsche Forschungsgemeinschaft","keywords":"Decidability; Recursion (computer science); Semantics (computer science); Infinite set; Set (abstract data type); Büchi automaton; Deterministic automaton; Base (topology); Pushdown automaton","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003509513,0.00133639,0.001087502,0.001574407,0.002290808,0.005775718,0.003198192,0.002526799,0.006419645],"category_scores_gemma":[0.005878304,0.001179923,0.002520128,0.0009515492,0.007426524,0.008488642,0.00303484,0.004812821,0.001955498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001981525,"about_ca_system_score_gemma":0.002904376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001430469,"about_ca_topic_score_gemma":0.001243472,"domain_scores_codex":[0.9963388,0.0009335065,0.000481187,0.0009174527,0.0009918843,0.0003372355],"domain_scores_gemma":[0.9962422,0.00158218,0.0003413346,0.0007373514,0.0008513255,0.000245766],"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.00002509689,0.00001805692,0.00007241342,0.00006381722,0.00001118844,0.0001121177,0.0006710563,0.001263523,0.002019562,0.9912366,0.0006308272,0.003875721],"study_design_scores_gemma":[0.00005097664,0.00005106101,0.00007838136,0.0000900486,0.00004668017,0.0002209982,0.0001846751,0.01503022,0.005225444,0.9404285,0.03853398,0.00005914758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01254362,0.0006520875,0.9685248,0.000905062,0.0003792477,0.0001686246,0.0004235353,0.002162168,0.01424095],"genre_scores_gemma":[0.4224904,0.0006136155,0.560437,0.000742836,0.0003907157,0.0007581774,0.0007619251,0.001138841,0.01266658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006419645,"threshold_uncertainty_score":0.02147591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08777243278367756,"score_gpt":0.4268065595087113,"score_spread":0.3390341267250337,"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."}}