{"id":"W2939756730","doi":"10.1145/3360571","title":"A path to DOT: formalizing fully path-dependent types","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Scala; Soundness; Computer science; Path (computing); Modular design; Programming language; Theoretical computer science; Mathematical proof; Algorithm; Mathematics; Java","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001306076,0.0005861679,0.0007185299,0.0002668796,0.0002007988,0.0009571172,0.008532228,0.0003792,0.000005957939],"category_scores_gemma":[0.00111285,0.0003991732,0.0004088014,0.0005002869,0.00007057624,0.0003002271,0.01002835,0.0008176523,0.00009135263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001459056,"about_ca_system_score_gemma":0.0001322924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002483638,"about_ca_topic_score_gemma":0.000009937714,"domain_scores_codex":[0.9962348,0.00003421051,0.0006750796,0.001125739,0.001101489,0.0008286429],"domain_scores_gemma":[0.996307,0.00009873907,0.0009285434,0.002004593,0.0004773902,0.0001837725],"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.0001910256,0.001029358,0.0252914,0.01134608,0.0008036221,0.00005452411,0.04147702,0.0002299992,0.007658686,0.3516162,0.009214363,0.5510877],"study_design_scores_gemma":[0.007697185,0.01081129,0.0148019,0.0131925,0.001581466,0.0008385421,0.02826131,0.005093267,0.2525671,0.3232898,0.3261898,0.01567584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8321247,0.01308342,0.03537489,0.01664742,0.01710347,0.02419117,0.00007603074,0.006108391,0.05529054],"genre_scores_gemma":[0.9643324,0.00002787211,0.03328097,0.0003374318,0.0003393826,0.0003065842,0.000005082864,0.00006249372,0.001307798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5354119,"threshold_uncertainty_score":0.999846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02033613119686185,"score_gpt":0.2669941272562975,"score_spread":0.2466579960594356,"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."}}