{"id":"W2128992690","doi":"10.2168/lmcs-1(2:1)2005","title":"General Recursion via Coinductive Types","year":2005,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Coinduction; Monad (category theory); Finitary; Domain theory; Type theory; Recursion (computer science); Partial function; Type (biology); Computer science; μ operator; Simple (philosophy); Domain (mathematical analysis); Partial evaluation; Theoretical computer science; Computability theory; Algebra over a field; Functional programming; Element (criminal law); Representation (politics); Primitive recursive function; Mathematics; Discrete mathematics; Programming language; Algorithm; Pure mathematics; Recursive functions; Functor","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00381099,0.0002039211,0.0003021927,0.0002445958,0.0002344737,0.0003216676,0.002231746,0.0001165641,0.00001857904],"category_scores_gemma":[0.0001481662,0.0001482757,0.00007585841,0.001723486,0.0004521677,0.0009018916,0.0009622258,0.0002986709,0.00009149892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001543199,"about_ca_system_score_gemma":0.00009640722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000419581,"about_ca_topic_score_gemma":0.000007384283,"domain_scores_codex":[0.9969155,0.0005384841,0.0003836439,0.00100116,0.0005141429,0.000647035],"domain_scores_gemma":[0.9985383,0.0002847807,0.0001269521,0.0006954113,0.000145754,0.0002088362],"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.000002567398,0.00008448264,0.0003062436,0.000003280362,0.000001995196,0.00001473497,0.0003758827,0.0007381233,0.001805091,0.197736,0.00003798257,0.7988936],"study_design_scores_gemma":[0.0003307905,0.0003771603,0.006666037,0.00000782354,0.000002444183,0.0001395629,0.000004688738,0.7771939,0.009116394,0.1935229,0.01220351,0.0004347464],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003528548,0.0001485954,0.9906104,0.0006919832,0.001816593,0.0002210179,1.113961e-7,0.0001922935,0.002790446],"genre_scores_gemma":[0.2838193,0.000005282096,0.7151808,0.0005298143,0.0003719177,0.00001155776,1.949933e-7,0.00000398835,0.00007713479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7984589,"threshold_uncertainty_score":0.6046507,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0759905153646028,"score_gpt":0.3791849483817478,"score_spread":0.303194433017145,"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."}}