{"id":"W2734180996","doi":"10.4230/lipics.ecoop.2017.23","title":"Interprocedural Specialization of Higher-Order Dynamic Languages Without Static Analysis","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Compiler; Computer science; Programming language; Interprocedural optimization; Compile time; Function (biology); Register allocation; Optimizing compiler; Parallel computing; Functional programming; Just-in-time compilation; Static analysis; Identity (music); Loop optimization","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.0009479225,0.0006356624,0.0005329301,0.0009258364,0.000553665,0.0008659716,0.0009760946,0.0003572271,0.001892761],"category_scores_gemma":[0.002433791,0.0005448982,0.000998517,0.0007014384,0.001055451,0.001393631,0.001454041,0.001003558,0.0006625869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006956593,"about_ca_system_score_gemma":0.001495258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009429964,"about_ca_topic_score_gemma":0.001585449,"domain_scores_codex":[0.9989619,0.0001975299,0.000087296,0.0001552449,0.0003827316,0.0002153052],"domain_scores_gemma":[0.9963065,0.001004767,0.0004024804,0.001898033,0.0003207283,0.00006746671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005876856,0.00031366,0.01537534,0.0008687823,0.0001918933,0.001807385,0.00187064,0.0835122,0.274588,0.07411271,0.005838208,0.5409335],"study_design_scores_gemma":[0.00008675696,0.0004584229,0.005833771,0.0001475918,0.0002502982,0.002101223,0.0001978474,0.3772045,0.5169224,0.04922878,0.04743933,0.0001289333],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2103957,0.0004634386,0.7587171,0.0001756071,0.00006917954,0.0001122452,0.0001240224,0.02123422,0.008708569],"genre_scores_gemma":[0.7811426,0.0002580024,0.2087456,0.0001779611,0.00005387593,0.00009976853,0.0003460043,0.003227663,0.005948566],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001892761,"threshold_uncertainty_score":0.00633198,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0111842810948102,"score_gpt":0.3166654499727183,"score_spread":0.3054811688779082,"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."}}