{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004144186,0.0001666689,0.0004027,0.000248401,0.00006246179,0.0001315613,0.0005167808,0.0001402241,0.000004149228],"category_scores_gemma":[0.0001157873,0.0001207743,0.0001150558,0.0004703941,0.00006027305,0.0005421585,0.00008813233,0.0004455135,4.079007e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003061794,"about_ca_system_score_gemma":0.00002286755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006666464,"about_ca_topic_score_gemma":0.000001591158,"domain_scores_codex":[0.9980916,0.0004390663,0.0006870915,0.0002028299,0.0002912701,0.0002881771],"domain_scores_gemma":[0.9990487,0.000251662,0.0002469024,0.0001846681,0.0001150583,0.0001530153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007868171,0.00004891489,0.0001650355,0.00003580144,0.00000901674,0.0000103339,0.0003593898,0.0001967401,0.001040329,0.09152285,0.000006297426,0.9065974],"study_design_scores_gemma":[0.001589374,0.001802221,0.004200289,0.0004280981,0.00004741297,0.001071512,0.00003099428,0.3258525,0.01620389,0.542282,0.1057292,0.0007626144],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006922252,0.0002587409,0.9917477,0.0005279374,0.0001792906,0.0001460141,2.666307e-7,0.0001428586,0.00007487531],"genre_scores_gemma":[0.1064433,0.00005346676,0.8933203,0.0001114686,0.00004790121,0.00001054722,4.158261e-7,0.000007601075,0.000005011623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9058348,"threshold_uncertainty_score":0.4925035,"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."}}