{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007730971,0.000870944,0.001263777,0.002517032,0.001817236,0.007113476,0.003013501,0.002683331,0.003464805],"category_scores_gemma":[0.01071599,0.00096066,0.002610921,0.002912218,0.01049461,0.01385667,0.003954102,0.003952248,0.001129002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003583036,"about_ca_system_score_gemma":0.002496073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003824058,"about_ca_topic_score_gemma":0.003851805,"domain_scores_codex":[0.9950059,0.002329694,0.0003935992,0.0007994786,0.00106209,0.000409264],"domain_scores_gemma":[0.9936149,0.003876682,0.0004169967,0.001366187,0.0005333417,0.0001917198],"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.000007837079,0.000006539525,0.0001260212,0.00003784976,0.000006698182,0.00004738671,0.0002951364,0.00516308,0.0002094238,0.9898976,0.0002824989,0.00391993],"study_design_scores_gemma":[0.0000124125,0.000009564092,0.00004120475,0.00003904791,0.00001198962,0.00006969445,0.00004787841,0.02818839,0.0003794657,0.9589142,0.01227346,0.00001263416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007577605,0.001229981,0.9786738,0.0006991657,0.0001264755,0.00007015481,0.00009850597,0.0005153744,0.0110091],"genre_scores_gemma":[0.2528391,0.002461271,0.7334774,0.0005721315,0.0004951097,0.0004412614,0.0003170042,0.000444813,0.008951844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007730971,"threshold_uncertainty_score":0.04088581,"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."}}