{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01436422,0.0002077816,0.0004947367,0.0005000515,0.0001024461,0.00007322334,0.003016062,0.0001451262,0.000004919708],"category_scores_gemma":[0.002365309,0.0001741566,0.0001200552,0.00300018,0.0008574051,0.0006557687,0.001244353,0.0002195934,0.000002738284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006276395,"about_ca_system_score_gemma":0.0001068701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001356864,"about_ca_topic_score_gemma":0.000003005204,"domain_scores_codex":[0.9966886,0.0003426338,0.001036139,0.0007207024,0.0005978175,0.0006140977],"domain_scores_gemma":[0.994631,0.003237633,0.0005094191,0.001189635,0.0002853268,0.0001469929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000405368,0.0002410701,0.001858409,0.0001015724,0.000006424272,0.000005889712,0.0008566893,0.004765077,0.01992357,0.1889775,0.00001493479,0.7832084],"study_design_scores_gemma":[0.0003963731,0.0004676651,0.02743604,0.00005471528,0.000004500302,0.00001121321,0.000005905426,0.8494956,0.07153967,0.05000822,0.000372916,0.0002071336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00975434,0.00001262934,0.9881452,0.000128177,0.0009195513,0.0004118906,0.000003454545,0.00009155002,0.0005331984],"genre_scores_gemma":[0.1154949,0.000007467542,0.8841896,0.0002389877,0.00004477453,0.00001015823,5.720414e-7,0.000007227376,0.000006335542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8447306,"threshold_uncertainty_score":0.7101901,"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."}}