{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003793986,0.0002689289,0.0005161361,0.0004370453,0.0004111166,0.0006136542,0.001732924,0.0001286353,0.00002291589],"category_scores_gemma":[0.0001562615,0.0002422323,0.0002249837,0.00042373,0.0001425642,0.001481139,0.0004723114,0.0001595722,0.00001495833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007286491,"about_ca_system_score_gemma":0.000067735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003920659,"about_ca_topic_score_gemma":0.0000524778,"domain_scores_codex":[0.9980618,0.00003437459,0.0008960836,0.000249752,0.0003771823,0.0003808313],"domain_scores_gemma":[0.9970911,0.00005965447,0.001095009,0.001188736,0.0004659521,0.00009950649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005995001,0.002434713,0.5186764,0.00476817,0.006883227,0.00002836126,0.07177087,0.08198561,0.0003938499,0.1959562,0.01828119,0.09822196],"study_design_scores_gemma":[0.001002188,0.0001324402,0.01042541,0.0001148814,0.0001323977,0.000005605959,0.0001876919,0.9833889,0.0007098029,0.0009246255,0.002594209,0.000381864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02936138,0.00002688228,0.9653204,0.000286279,0.0003265333,0.000428337,0.00008667987,0.0002801789,0.003883343],"genre_scores_gemma":[0.8177341,0.00002259293,0.1811667,0.0002524308,0.00004139376,0.00002527917,0.0001519783,0.00001770893,0.0005878222],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9014033,"threshold_uncertainty_score":0.9877946,"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."}}