{"id":"W2148870725","doi":"10.1109/lics.1991.151659","title":"A computation model for executable higher-order algebraic specification languages","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Functional programming; Recursion (computer science); Computer science; Programming language; Algebraic specification; Lemma (botany); Generalization; Theoretical computer science; Algebra over a field; Primitive recursive function; Algebraic number; Executable; Mathematics; Discrete mathematics; Pure mathematics; Algorithm; Specification 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.0001285859,0.0000914491,0.0001045836,0.00005501661,0.00009647917,0.0001666193,0.0002745442,0.00005087471,0.00004666623],"category_scores_gemma":[0.00001032373,0.00007552945,0.00004126517,0.0002136835,0.00001523963,0.000312101,0.00003785699,0.00003603398,0.0001574179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002503471,"about_ca_system_score_gemma":0.000009629928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002968493,"about_ca_topic_score_gemma":0.000008102499,"domain_scores_codex":[0.9991993,0.00001941971,0.0001631474,0.0002740515,0.0001437254,0.0002003374],"domain_scores_gemma":[0.9994912,0.00004275257,0.00006875047,0.0002424552,0.0001079394,0.0000469686],"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.000001348094,0.00007701585,0.00004377602,0.00002119188,0.000009621965,0.000001005973,0.0008947207,0.002408213,0.0002004157,0.9342474,0.01642397,0.0456713],"study_design_scores_gemma":[0.0002414507,0.00003744454,0.00006499651,9.282891e-7,0.000003132209,0.000003021704,0.00003071939,0.9589965,0.0001811822,0.02898091,0.01134377,0.0001159879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001879665,0.0002419044,0.9723921,0.0007461577,0.000198769,0.0003096572,4.841168e-7,0.000296986,0.02562595],"genre_scores_gemma":[0.8716568,0.000006378926,0.1041647,0.000206653,0.00009592235,0.00005362971,0.000008159722,0.000008076104,0.02379961],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9565883,"threshold_uncertainty_score":0.3080001,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05376486799649755,"score_gpt":0.27300515033522,"score_spread":0.2192402823387225,"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."}}