{"id":"W1991997530","doi":"10.1016/j.jlap.2014.02.010","title":"Towards “mouldable code” via nested code graph transformation","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Graph rewriting; Computer science; Programming language; Transformation (genetics); Abstract syntax tree; Theoretical computer science; Graph; Program transformation; Control flow graph; Code generation; Control flow; Parsing; Key (lock)","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.0004357535,0.0005496269,0.0004293578,0.0007184993,0.0005144765,0.0008187644,0.001171925,0.0007986272,0.004998737],"category_scores_gemma":[0.002286154,0.000449855,0.001207256,0.000456355,0.001588191,0.001412605,0.002070185,0.001491013,0.001260509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004074941,"about_ca_system_score_gemma":0.000660955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303692,"about_ca_topic_score_gemma":0.001943985,"domain_scores_codex":[0.9992414,0.0001521956,0.00003028894,0.0001423449,0.0003551579,0.00007864825],"domain_scores_gemma":[0.9989904,0.0002702629,0.00006284631,0.0004560567,0.000185222,0.00003519467],"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.0001067712,0.0001654916,0.0007144731,0.0002699939,0.00006275262,0.00036125,0.0006455102,0.09519735,0.06698109,0.6187397,0.006382192,0.2103734],"study_design_scores_gemma":[0.00003551617,0.00008657341,0.0002623995,0.00005807787,0.00005214105,0.0002452986,0.0001104443,0.5561334,0.06221371,0.3387906,0.04196983,0.00004190251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009589882,0.0000220571,0.9835133,0.00007978226,0.00003966634,0.00004076134,0.00002633317,0.003004968,0.003683225],"genre_scores_gemma":[0.2036981,0.00008094739,0.7874438,0.0001594959,0.00002135723,0.0001149398,0.0002289116,0.002567618,0.005684814],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004998737,"threshold_uncertainty_score":0.01672244,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03748765793481015,"score_gpt":0.3395141873912903,"score_spread":0.3020265294564801,"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."}}