{"id":"W2146471655","doi":"10.1017/s0960129505004822","title":"Modelling general recursion in type theory","year":2005,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Type theory; Recursion (computer science); Mathematical proof; Computer science; Mutual recursion; Type (biology); Theory of computation; Functional programming; Constructive; Predicate (mathematical logic); Proof theory; Theoretical computer science; Algorithm; Mathematics; Programming language","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.001460478,0.0001647187,0.0002250214,0.0002557794,0.0001119853,0.0003164531,0.001695551,0.00006408716,0.0000226038],"category_scores_gemma":[0.00005315551,0.000122683,0.00003831436,0.001096318,0.0002312009,0.0005775519,0.0005305833,0.0002067903,0.00004680582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001271977,"about_ca_system_score_gemma":0.00008309323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001281896,"about_ca_topic_score_gemma":0.000005629245,"domain_scores_codex":[0.9979038,0.00009612074,0.0003838678,0.0005802068,0.0005178938,0.0005181428],"domain_scores_gemma":[0.9990414,0.0001319783,0.000072284,0.0005760968,0.00006312381,0.0001150549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002865037,0.00003468216,0.0001167898,0.00001301824,7.673937e-7,0.00001084048,0.0009842973,0.0583535,0.00003219308,0.8309892,0.00001583971,0.109446],"study_design_scores_gemma":[0.00009248887,0.00001934596,0.0001269013,0.000006906571,3.671157e-7,0.00002436265,0.000003224334,0.5470634,0.0001561862,0.4522064,0.0002060476,0.00009435514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04986013,0.0001404532,0.947799,0.0001625805,0.0005567954,0.0001756425,8.029436e-8,0.00008308509,0.001222246],"genre_scores_gemma":[0.7016475,0.000003125104,0.2980271,0.0001528259,0.0001333611,0.000003712477,1.849122e-7,0.000004496054,0.00002761866],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6517874,"threshold_uncertainty_score":0.5002868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02889547040022715,"score_gpt":0.2744766433418571,"score_spread":0.24558117294163,"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."}}