{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00433099,0.0007012559,0.0009438306,0.002253439,0.001721956,0.004692992,0.001347452,0.001428691,0.003975845],"category_scores_gemma":[0.004632773,0.0007372663,0.001984176,0.002164614,0.007855919,0.01179657,0.004970094,0.003453824,0.0009073624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002716874,"about_ca_system_score_gemma":0.001623368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001793581,"about_ca_topic_score_gemma":0.002144977,"domain_scores_codex":[0.99713,0.0008171825,0.0002390157,0.0005556687,0.0008526793,0.0004055728],"domain_scores_gemma":[0.9975237,0.001047385,0.0001955572,0.0007386365,0.0003557134,0.0001390098],"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.000003656956,0.000002460478,0.0000480386,0.0000110435,0.000001985708,0.00002087759,0.00009684409,0.0004079569,0.000173316,0.9973776,0.0001143697,0.001741749],"study_design_scores_gemma":[0.000008475512,0.00001143105,0.00005731928,0.00001689835,0.00001247264,0.00008944044,0.00002968622,0.006117408,0.0008078394,0.983847,0.008988569,0.00001343001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04561505,0.002055241,0.914053,0.00112423,0.0003472438,0.00008362133,0.0001561077,0.0009627231,0.03560275],"genre_scores_gemma":[0.7339051,0.002310526,0.2382824,0.0008897267,0.0005100041,0.0003144451,0.0002669088,0.0004565051,0.02306446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004692992,"threshold_uncertainty_score":0.02290475,"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."}}