Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
List of programming language researchers
open-in-new
<h2 id="a">A</h2> <ul><li><a href="/facts/Mart%25C3%25ADn_Abadi/yyDbTR5l">Martín Abadi</a>, for the programming language <a href="/facts/Baby_Modula-3/1zNHfszU">Baby Modula-3</a> and his book (with <a href="/facts/Luca_Cardelli/bQjxEQhA">Luca Cardelli</a>) <i>A Theory of Objects</i></li> <li><a href="/facts/Samson_Abramsky/qpcVXuos">Samson Abramsky</a>, contributions to the areas of the lazy <a href="/facts/Lambda_calculus/DaD3RuQ4">lambda calculus</a> and <a href="/facts/Concurrency_theory/Ctnrrq4A">concurrency theory</a> and co-editing the 6 Volume <i>Handbook of Logic in Computer Science</i></li> <li><a href="/facts/Jean-Raymond_Abrial/N3eRyg3q">Jean-Raymond Abrial</a>, father of the <a href="/facts/Z_notation/5mUjpTvv">Z notation</a> and the <a href="/facts/B-Method/qkkqG05M">B-Method</a>, targeted at the clear specification and refinement of <a href="/facts/Computer_program/e38jH9N9">computer programs</a> and computer-based systems in general</li> <li><a href="/facts/Vikram_Adve/9kDaIV52">Vikram Adve</a>, the 2012 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/LLVM/nPmcspQN">LLVM</a>, a set of <a href="/facts/Compiler/WNfCDFJe">compiler</a> and <a href="/facts/Toolchain/SmlWCJhY">toolchain</a> technologies</li> <li><a href="/facts/Gul_Agha_(computer_scientist)/7RSJ2NsR">Gul Agha</a>, elected as an <a href="/facts/ACM_Fellow/kEuoGr62">ACM Fellow</a> in 2018 for <i>research in concurrent programming and formal methods, specifically the <a href="/facts/Actor_model/MJ49opnU">Actor Model</a></i></li> <li><a href="/facts/Alfred_Aho/ljoQ1CMU">Alfred Aho</a>, the A of AWK, 2020 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for fundamental algorithms and theory underlying programming language implementation and for synthesizing these results ...highly influential books ...</li> <li><a href="/facts/Frances_Allen/GtoQRgdB">Frances Allen</a>, the 2006 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for pioneering contributions to the theory and practice of optimizing compiler techniques ...</li> <li><a href="/facts/Andrew_Appel/9xMstTq1">Andrew Appel</a>, especially well-known because of his <a href="/facts/Compiler/WNfCDFJe">compiler</a> books, the <i>Modern Compiler Implementation in ML</i> (<a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-521-58274-1) series, as well as <i>Compiling With Continuations</i> (<a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-521-41695-7)</li> <li><a href="/facts/Krzysztof_R._Apt/veQfqndA">Krzysztof R. Apt</a>, the use of <a href="/facts/Logic_programming/Xgh8lj3F">logic as a programming language</a></li> <li><a href="/facts/Bruce_Arden/J3yJyGrs">Bruce Arden</a>, co-authored two compilers, GAT<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> for the <a href="/facts/IBM_650/l5mCAMIF">IBM 650</a> and <a href="/facts/MAD_(programming_language)/FbRhDUQt">MAD</a></li> <li><a href="/facts/Arvind_(computer_scientist)/2CRcoFbV">Arvind</a>, see Arvind Mithal</li> <li><a href="/facts/Lennart_Augustsson/DKbCzoRm">Lennart Augustsson</a>, languages (Lazy <a href="/facts/ML_(programming_language)/RfwxASRF">ML</a>, Cayenne), compilers (HBC <a href="/facts/Haskell/ydEsHuGy">Haskell</a>, parallel Haskell front end, <a href="/facts/Bluespec/INcoF6XJ">Bluespec</a> <a href="/facts/SystemVerilog/wkBdc179">SystemVerilog</a> early)</li></ul> <h2 id="b">B</h2> <ul><li><a href="/facts/Ralph-Johan_Back/w8w3UBtC">Ralph-Johan Back</a>, originated the <a href="/facts/Refinement_calculus/N7PM9L7G">refinement calculus</a>, used in the formal development of programs using stepwise <a href="/facts/Refinement_(computing)/ehdFJQ9T">refinement</a></li> <li><a href="/facts/Roland_Backhouse/wsgMPfD3">Roland Backhouse</a>, work on the mathematics of program construction and algorithm problem solving; books on <i>Syntax of Programming Languages</i>, <i> Program Construction and Verification</i>, and more</li> <li><a href="/facts/John_Backus/pqELHDh6">John Backus</a>, the 1977 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for profound, influential, and lasting contributions to the design of practical high-level programming systems, notably through his work on <a href="/facts/FORTRAN/m1KqjcMU">FORTRAN</a>, and for seminal publication of formal procedures for the specification of programming languages</li> <li><a href="/facts/George_N._Baird/WI30q3fF">George N. Baird</a>, the <a href="/facts/Grace_Murray_Hopper_Award/QWm4lPuk">1974 Grace Murray Hopper Award</a> for his \development and implementation of the Navy's COBOL Compiler Validation System</li> <li><a href="/facts/Lars_Bak_(computer_programmer)/M6v66HJt">Lars Bak</a>, the 2018 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for pioneering work in pointer-safe object-orientation and leading the implementation of <a href="/facts/BETA_(programming_language)/zw6sMHL2">Beta</a>, <a href="/facts/Self_(programming_language)/sBp39553">Self</a>, <a href="/facts/Strongtalk/6DY4wfR9">Strongtalk</a>, <a href="/facts/HotSpot_(virtual_machine)/m6vjRXvm">Java Hotspot</a>, ..., the ACM SIGPLAN 2016 PL Software Award<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> for <a href="/facts/V8_(JavaScript_engine)/0Fd3taMh">V8 Javascript</a></li> <li><a href="/facts/Henri_Bal/vVopyRnL">Henri Bal</a>, programming languages for distributed systems, e.g. Orca<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a></li> <li><a href="/facts/Friedrich_L._Bauer/JlesFToV">Friedrich L. Bauer</a>, proposed the <a href="/facts/Stack_(data_structure)/bj7l94v1">stack method</a> of expression evaluation, member of the <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a> Committee, see also<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a></li> <li><a href="/facts/Kent_Beck/aNaBgCtC">Kent Beck</a>, a leading proponent of <a href="/facts/Test-driven_development/fDCzXkt1">test-driven development</a> (TDD), pioneered <a href="/facts/Software_design_pattern/mV7r4egw">software design patterns</a>, and co-wrote <a href="/facts/JUnit/zlddF9S2">JUnit</a> for Java</li> <li><a href="/facts/Jeff_Bezanson/TlaxIuYu">Jeff Bezanson</a>, the 2019 <a href="/facts/J._H._Wilkinson_Prize_for_Numerical_Software/5pQ82QP5">J. H. Wilkinson Prize for Numerical Software</a> for the co-development of the <a href="/facts/Julia_(programming_language)/AoB0PJ9C">Julia</a> language</li> <li><a href="/facts/Dines_Bj%25C3%25B8rner/8KnFr7FG">Dines Bjørner</a>, the <a href="/facts/Vienna_Development_Method/ormJgInD">Vienna Development Method</a> (VDM), the <a href="/facts/Rigorous_Approach_to_Industrial_Software_Engineering/BcvF31dC">Raise specification language</a></li> <li><a href="/facts/Daniel_Bobrow/GKssbwds">Daniel Bobrow</a>, 1992 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the <a href="/facts/Integrated_development_environment/jbEINSQf">IDE</a> named <a href="/facts/Interlisp/zSEUS17z">Interlisp</a></li> <li><a href="/facts/Corrado_B%25C3%25B6hm/DQX9Wz7T">Corrado Böhm</a>, defined <a href="/facts/B%25C3%25B6hm%2527s_language/6KQuvQsW">Böhm's language</a>, the first <a href="/facts/Meta-circular_evaluator/1V4CyuTQ">meta-circular evaluator</a>, contributed the <a href="/facts/Structured_program_theorem/KjH4V4Ju">structured program theorem</a></li> <li><a href="/facts/Grady_Booch/RzM2Yvkp">Grady Booch</a>, developer of <a href="/facts/Unified_Modeling_Language/3tlNS0tH">Unified Modeling Language</a> (UML)</li> <li><a href="/facts/Kathleen_Booth/EqozPTAr">Kathleen Booth</a>, designed and developed first <a href="/facts/Assembly_language/7XuV0cla">assembly language</a></li> <li><a href="/facts/Stephen_R._Bourne/x7p7ALJH">Stephen R. Bourne</a>, developed <a href="/facts/ALGOL_68C/XMd0oYIK">ALGOL 68C</a>, member <a href="/facts/IFIP_Working_Group_2.1/JhPYRM7c">IFIP Working Group 2.1</a> on Algorithmic Languages and Calculi</li> <li><a href="/facts/Gilad_Bracha/eJEXUGIW">Gilad Bracha</a>, the 2017 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for outstanding work on many topics relevant to OO, including <a href="/facts/Mixin/QHG68mgY">mixins</a>, <a href="/facts/Java_generics/j8nFhEKq">Java generics</a>, <a href="/facts/Strongtalk/6DY4wfR9">Strongtalk</a>, and <a href="/facts/Newspeak_(programming_language)/QL4sDDVY">Newspeak</a></li> <li><a href="/facts/Larry_Breed/SDhf6AvQ">Larry Breed</a>, 1973 <a href="/facts/Grace_Murray_Hopper_Award/QWm4lPuk">Grace Murray Hopper Award</a> for designing and implementing <a href="/facts/APL_(programming_language)/E2sb98gC">APL</a>\360</li> <li><a href="/facts/Walter_Bright/0xEdf597">Walter Bright</a>, designer of <a href="/facts/D_(programming_language)/4qIzRjkF">D</a></li> <li><a href="/facts/Per_Brinch_Hansen/ofL1Pd9M">Per Brinch Hansen</a> (surname "Brinch Hansen"), the IEEE Computer Society 2002 <a href="/facts/Computer_Pioneer_Award/9PKCGf5W">Computer Pioneer Award</a> for ... <a href="/facts/Concurrent_Pascal/CGuRkBEL">Concurrent Pascal</a></li> <li><a href="/facts/Kim_Bruce/xUKypuvF">Kim Bruce</a>, the 2021 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for ... programming language theory and design in general and object orientation specifically<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a></li> <li><a href="/facts/Margaret_Burnett/AIK50SvE">Margaret Burnett</a>, pioneering contributions to <a href="/facts/Visual_programming_language/j0eyIPzU">visual programming languages</a></li> <li><a href="/facts/Rod_Burstall/BhNTxat5">Rod Burstall</a>, languages <a href="/facts/COWSEL/BPkvM4xu">COWSEL</a> (renamed POP-1), <a href="/facts/POP-2/5hdL9dPY">POP-2</a>, <a href="/facts/NPL_(programming_language)/Pdw0t7LF">NPL</a>, <a href="/facts/Hope_(programming_language)/BuFSs6F4">Hope</a>; ACM SIGPLAN 2009 PL Achievement Award<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a></li> <li><a href="/facts/Richard_R._Burton/UTQI3QPw">Richard Burton</a>, the 1992 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the <a href="/facts/Integrated_development_environment/jbEINSQf">IDE</a> called <a href="/facts/Interlisp/zSEUS17z">Interlisp</a></li></ul> <h2 id="c">C</h2> <ul><li><a href="/facts/Luca_Cardelli/bQjxEQhA">Luca Cardelli</a>, research in <a href="/facts/Type_theory/xj0xzVqI">type theory</a> and <a href="/facts/Operational_semantics/G24LXz6e">operational semantics</a>, helped develop <a href="/facts/Modula-3/RbblULyn">Modula-3</a> and <a href="/facts/Polyphonic_C/fIkbRTIs">Polyphonic C#</a>, first <a href="/facts/Compiler/WNfCDFJe">compiler</a> for <a href="/facts/ML_(programming_language)/RfwxASRF">ML</a>, the 2007 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a>, <a href="https://www.sigplan.org/Awards/POPL/">"POPL 2000 Most Influential Paper Award"</a>.</li> <li><a href="/facts/Craig_Chambers/nIEmjMNB">Craig Chambers</a>, the 2011 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for the design of <a href="/facts/Cecil_(programming_language)/YUGhrhvM">Cecil</a> and his work on compiler techniques used to implement OO languages ...</li> <li><a href="/facts/John_Chambers_(statistician)/JgjFu5jw">John Chambers</a>, the 1998 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the programing language <a href="/facts/S_(programming_language)/VTG29WnE">S</a></li> <li><a href="/facts/K._Mani_Chandy/RRdCypvB">K. Mani Chandy</a>, contributions to the verification of parallel programming languages, including the language <a href="/facts/UNITY_(programming_language)/HedwxILy">UNITY</a></li> <li><a href="/facts/Alonzo_Church/b7D52Itv">Alonzo Church</a>, the <a href="/facts/Lambda_calculus/DaD3RuQ4">Lambda calculus</a>; considered a founder of <a href="/facts/Computer_science/lN3pEyPz">computer science</a></li> <li><a href="/facts/John_Cocke_(computer_scientist)/u2q0rtyw">John Cocke</a>, the 1987 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for significant contributions in the design and theory of compilers, ..., and ...; co-developed the <a href="/facts/CYK_algorithm/W2J1SJ9z">CYK parsing algorithm</a></li> <li><a href="/facts/Alain_Colmerauer/HzI8opM2">Alain Colmerauer</a>, creator of <a href="/facts/Prolog/r5h66Qh1">Prolog</a></li> <li><a href="/facts/Richard_W._Conway/rIPdBjkU">Richard W. Conway</a>, for the introductory languages <a href="/facts/CORC/Y4nV2oMB">CORC</a> and <a href="/facts/Cornell_University_Programming_Language/K7yTaYT2">CUPL</a> and the student-oriented dialect <a href="/facts/PL%2fC/bBjIG9dh">PL/C</a>; for extensive error correction so that <a href="/facts/PL%2fC/bBjIG9dh">every program compiled</a></li> <li><a href="/facts/William_Cook_(computer_scientist)/PWPluAgM">William Cook</a>, chief architect of <a href="/facts/AppleScript/cc3rc4wD">AppleScript</a>, the 2014 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for contributions to the theory and practice of OO programming<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a></li> <li><a href="/facts/Keith_D._Cooper/xgnbQRMg">Keith Cooper</a>, research on programming languages, compilers, optimization, and static analysis</li> <li><a href="/facts/Thierry_Coquand/jG36x5By">Thierry Coquand</a>, ACM SIGPLAN 2013 PL Software Award<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> and the 2015 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/Coq_proof_assistant/7oBXgLCE">Coq</a></li> <li><a href="/facts/Patrick_Cousot/4FeJuA9V">Patrick Cousot</a>, for contributions to <a href="/facts/Programming_language/cWTYbgWa">programming languages</a> through the co-invention of <a href="/facts/Abstract_interpretation/cj6wjzu1">abstract interpretation</a>, ACM SIGPLAN 2013 PL Achievement Award<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a></li> <li><a href="/facts/Radhia_Cousot/c2qTHTnr">Radhia Cousot</a>, for contributions to <a href="/facts/Programming_language/cWTYbgWa">programming languages</a> through the co-invention of <a href="/facts/Abstract_interpretation/cj6wjzu1">abstract interpretation</a>, ACM SIGPLAN 2013 PL Achievement Award<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a></li> <li><a href="/facts/James_Cordy/0a9AhkBk">James Cordy</a>, known for the <a href="/facts/TXL_(programming_language)/Nohn8cGt">TXL</a> source transformation language, a parser-based framework and functional programming language designed to support software analysis and transformation tasks</li></ul> <h2 id="d">D</h2> <ul><li><a href="/facts/Ole-Johan_Dahl/4XzG0v9q">Ole-Johan Dahl</a>, the 2001 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for ideas fundamental to the emergence of OO programming, through [the] design of the programming languages <a href="/facts/Simula/gaEVG7SL">Simula</a> I and 67</li> <li><a href="/facts/Olivier_Danvy/aB7RoUWE">Olivier Danvy</a> specializes in <a href="/facts/Programming_language/cWTYbgWa">programming languages</a>, <a href="/facts/Partial_evaluation/cSBKhRPo">partial evaluation</a>, and <a href="/facts/Continuation/53gyBXrB">continuations</a></li> <li><a href="/facts/John_Darlington/EfKAWHDz">John Darlington</a>, work on program transformation and functional programming, including <a href="/facts/NPL_(programming_language)/Pdw0t7LF">NPL</a> and <a href="/facts/Hope%252B/BuFSs6F4">Hope+</a></li> <li><a href="/facts/L._Peter_Deutsch/f4BmluYL">L. Peter Deutsch</a>, first implementation of <a href="/facts/TRAC_(programming_language)/8EB5dXFQ">TRAC</a> (on the <a href="/facts/PDP-1/PSeIBDJU">PDP-1</a>), first <a href="/facts/REPL/lddjCYxt">REPL</a>, PhD thesis on an interactive <a href="/facts/Program_verifier/BYD4GnJR">program verifier</a>, the 1992 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the <a href="/facts/Integrated_development_environment/jbEINSQf">IDE</a> called <a href="/facts/Interlisp/zSEUS17z">Interlisp</a></li> <li><a href="/facts/Edsger_W._Dijkstra/910x0MjT">Edsger W. Dijkstra</a>, first <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a> compiler, <a href="/facts/Predicate_transformer_semantics/bxK9TNh7">weakest preconditions</a>, the 1972 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for fundamental contributions to developing programming languages</li> <li><a href="/facts/Damien_Doligez/GnMvCRq1">Damien Doligez</a>, co-developer and implementor of <a href="/facts/OCaml/ThBGLND8">OCaml</a>, especially its <a href="/facts/Garbage_collection_(computer_science)/j2vlIu7g">garbage collector</a></li> <li><a href="/facts/Sophia_Drossopoulou/PoUabull">Sophia Drossopoulou</a>, formal methods for <a href="/facts/Programming_language/cWTYbgWa">programming languages</a>, proof of the soundness of <a href="/facts/Java_(programming_language)/9ScgFyAL">Java</a></li></ul> <h2 id="e">E</h2> <ul><li><a href="/facts/Wim_Ebbinkhuijsen/Ahxx9Mtf">Wim Ebbinkhuijsen</a>, one of the fathers of <a href="/facts/COBOL/wVnhqs0k">COBOL</a>, designed and rewrote dozens of parts of the current COBOL standard</li> <li><a href="/facts/Alan_Edelman/YMYDACSo">Alan Edelman</a>, the <a href="/facts/Sidney_Fernbach_Award/SW8WpJvF">2019 Sidney Fernbach Award</a> for ... and for contributions to the <a href="/facts/Julia_programming_language/AoB0PJ9C">Julia programming language</a></li> <li><a href="/facts/Brendan_Eich/uGhIVGoz">Brendan Eich</a>, designer of <a href="/facts/JavaScript/XhhIIEsl">JavaScript</a></li> <li><a href="/facts/Andrey_Ershov/z2B4LyoI">Andrey Ershov</a>, see Andrey Yershov</li></ul> <h2 id="f">F</h2> <ul><li><a href="/facts/Mahmoud_Samir_Fayed/fJ0e878p">Mahmoud Samir Fayed</a>, creator of <a href="/facts/PWCT/M5GnIHfA">PWCT</a> and <a href="/facts/Ring_(programming_language)/1Qy2pDXu">Ring</a></li> <li><a href="/facts/Matthias_Felleisen/zU62cWPr">Matthias Felleisen</a>, ACM SIGPLAN 2018 PL Software Award<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> for <a href="/facts/Racket_(programming_language)/5n7LW08b">Racket</a>, ACM SIGPLAN 2012 PL Achievement Award<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a></li> <li><a href="/facts/Jeanne_Ferrante/df4fXMho">Jeanne Ferrante</a>, developed the <a href="/facts/Program_dependence_graph/92cgYvRM">Program dependence graph</a>, ACM SIGPLAN 2006 PL Achievement Award<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a></li> <li><a href="/facts/Robby_Findler/et97GVMA">Robby Findler</a>, thesis on linguistics of software contracts, the ACM SIGPLAN 2018 PL Software Award<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> for <a href="/facts/Racket_(programming_language)/5n7LW08b">Racket</a>, design/implementation of <i>Redex</i>, a workbench for semantics engineers</li> <li><a href="/facts/Keno_Fischer/23yHCXCH">Keno Fischer</a>, a core member implementing the <a href="/facts/Julia_(programming_language)/AoB0PJ9C">Julia</a> programming language,</li> <li><a href="/facts/Matthew_Flatt/cEbwLbSY">Matthew Flatt</a>, ACM SIGPLAN 2018 PL Software Award<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a> for <a href="/facts/Racket_(programming_language)/5n7LW08b">Racket</a></li> <li><a href="/facts/Robert_W._Floyd/sTFRb3TH">Robert W. Floyd</a>, the 1978 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for ..., and for helping to found the following important subfields of computer science: the theory of parsing, the semantics of programming languages, automatic program verification, automatic program synthesis, and analysis of algorithms</li> <li><a href="/facts/Robert_France/33JldXut">Robert France</a>, the 2014 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for his research on adding formal semantics to OO modeling notations</li> <li><a href="/facts/Daniel_P._Friedman/s4UQAy9M">Daniel P. Friedman</a>, influential paper on <a href="/facts/Lazy_evaluation/mD3DxDkc">lazy programming</a>, explored <a href="/facts/Macro_(computer_science)/7abAsm1o">macros</a> for defining programming languages, lead author of <i><a href="/facts/Essentials_of_Programming_Languages/rhBg4uQY">Essentials of Programming Languages</a></i></li> <li><a href="/facts/Yoshihiko_Futamura/cSBKhRPo">Yoshihiko Futamura</a>, partial evaluation, especially Futamura projections</li></ul> <h2 id="g">G</h2> <ul><li><a href="/facts/Richard_P._Gabriel/0N3SGIES">Richard P. Gabriel</a>, for work on <a href="/facts/Lisp_(programming_language)/xJHA3CrX">Lisp</a>, and especially <a href="/facts/Common_Lisp/mq1pRbSF">Common Lisp</a>; the 2004 ACM-AAAI Allen Newell Award<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a> for innovations in programming languages and software design ...</li> <li><a href="/facts/Bernard_Galler/eQ0a15QB">Bernard Galler</a>, involved in the development of computer languages, including <a href="/facts/MAD_(programming_language)/FbRhDUQt">MAD</a></li> <li><a href="/facts/Erich_Gamma/5RulmUAp">Erich Gamma</a>, co-wrote the <a href="/facts/JUnit/zlddF9S2">JUnit</a> software testing framework; one of the <a href="/facts/Design_Patterns/bHvkoxsu">Gang of Four</a>, the 2006 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a>, for ... their book <i><a href="/facts/Design_Patterns_(book)/sYDxSGc9">Design Patterns: ...</a></i>, ACM SIGPLAN 2005 PL Achievement Award<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a></li> <li><a href="/facts/Charles_Geschke/0qrM4R5H">Charles Geschke</a>, co-author of <a href="/facts/The_Design_of_an_Optimizing_Compiler/YxI8YyWH">The Design of an Optimizing Compiler</a>, the 1989 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/PostScript/4EeEtnLv">PostScript</a></li> <li><a href="/facts/Jeremy_Gibbons/KProbaxV">Jeremy Gibbons</a>,<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a> <a href="/facts/Generic_programming/kqtqJk7p">generic programming</a> and <a href="/facts/Functional_programming/cdxqPEIM">functional programming</a>, member of <a href="/facts/IFIP_Working_Group_2.1/JhPYRM7c">IFIP Working Group 2.1</a> on Algorithmic Languages and Calculi, which supports and maintains <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a> and <a href="/facts/ALGOL_68/NTnc9fy7">ALGOL 68</a></li> <li><a href="/facts/Seymour_Ginsburg/l5Are2u3">Seymour Ginsburg</a>, fundamental work in <a href="/facts/Formal_languages/crDTyP8q">formal languages</a> and <a href="/facts/Abstract_family_of_languages/QC4HUyXt">abstract family of languages</a></li> <li><a href="/facts/Adele_Goldberg_(computer_scientist)/FhCtLdpJ">Adele Goldberg</a>, the 1987 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/Smalltalk/Ru2UPVDE">Smalltalk</a></li> <li><a href="/facts/Andrew_D._Gordon/XTDJElgC">Andrew Gordon</a>, co-designer of <a href="/facts/Concurrent_Haskell/9VHhLgvD">Concurrent Haskell</a>, co-inventor of the <a href="/facts/Ambient_calculus/L4yDTuwW">ambient calculus</a> for reasoning about <a href="/facts/Mobile_code/0fNnzUxw">mobile code</a>, designed <a href="/facts/SecPAL/UEkrxjW9">SecPAL</a></li> <li><a href="/facts/James_Gosling/AIKS55X9">James Gosling</a>, the 2002 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/Java_(programming_language)/9ScgFyAL">Java</a></li> <li><a href="/facts/Robert_M._Graham_(computer_scientist)/mS1E5Vgn">Robert Graham</a>, co-authored two compilers, GAT<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a> for the <a href="/facts/IBM_650/l5mCAMIF">IBM 650</a> and <a href="/facts/MAD_(programming_language)/FbRhDUQt">MAD</a></li> <li><a href="/facts/Susan_L._Graham/IVQ8G6jG">Susan Graham</a>, the 2009 <a href="/facts/IEEE_John_von_Neumann_Medal/eABth7GF">IEEE John von Neumann Medal</a> for "contributions to PL design and implementation ...", member <a href="/facts/National_Academy_of_Engineering/6RCqfvXM">NAE</a>,<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a> ACM SIGPLAN 2000 PL Achievement Award<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a></li> <li><a href="/facts/Cordell_Green/M3MsBIqw">Cordell Green</a>, the <a href="/facts/Grace_Murray_Hopper_Award/QWm4lPuk">1985 Grace Murray Hopper Award</a> for establishing the theoretical basis of the field of <a href="/facts/Logic_programming/Xgh8lj3F">logic programming</a></li> <li><a href="/facts/Sheila_Greibach/7vr5bkQn">Sheila Greibach</a>, grammar theory, <a href="/facts/Greibach_normal_form/5zGXy9Po">Greibach normal form</a></li> <li><a href="/facts/David_Gries/36zCYJT8">David Gries</a>, first text on writing compilers,<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a><a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a> contributions to semantics of programming language constructs, e.g. <a href="/facts/Interference_freedom/hj5NPfv5">Interference freedom</a> and<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a></li> <li><a href="/facts/Robert_Griesemer/9PbEjSuI">Robert Griesemer</a>, co-designer of <a href="/facts/Go_(programming_language)/oWlsmAFJ">Go</a></li> <li><a href="/facts/Ralph_Griswold/BSV8ExA3">Ralph Griswold</a>, designer of <a href="/facts/SNOBOL/cdF7ezMJ">SNOBOL</a>, SL5, and <a href="/facts/Icon_(programming_language)/J7QHUDqq">Icon</a></li> <li><a href="/facts/J%25C3%25BCrg_Gutknecht/Esxfouwf">Jürg Gutknecht</a>, co-developer of the language <a href="/facts/Oberon_(programming_language)/YHFyy3UU">Oberon</a>, developer of the language <a href="/facts/Zonnon/SIao4dXy">Zonnon</a></li> <li><a href="/facts/John_Guttag/7m0bmHXb">John Guttag</a>, co-developer of the <a href="/facts/Larch_family/1CVr4nNn">Larch family</a> of formal <a href="/facts/Specification_language/vqNInfdh">specification languages</a> and the <a href="/facts/Larch_Prover/l7D3FU9R">Larch Prover</a> (LP)</li> <li><a href="/facts/Michael_Guy/TjWdLhA3">Michael Guy</a>, co-author of <a href="/facts/ALGOL_68C/XMd0oYIK">ALGOL 68C</a></li></ul> <h2 id="h">H</h2> <ul><li><a href="/facts/Nico_Habermann/2h7DpL6S">Nico Habermann</a>, co-designer of <a href="/facts/BLISS/5rYFKqDT">BLISS</a></li> <li><a href="/facts/Robert_Harper_(computer_scientist)/3SqHRgE4">Robert Harper</a>, contributions to <a href="/facts/Standard_ML/4LaEq9tA">Standard ML</a> and the <a href="/facts/LF_(logical_framework)/bVGxB8Lk">LF logical framework</a>, ACM SIGPLAN 2021 PL Achievement Award<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a> for foundational contributions to type theory</li> <li><a href="/facts/Eric_Hehner/EnUm5Qef">Eric Hehner</a>, for <a href="/facts/Predicative_programming/y6LeAYGe">predicative programming</a>, a formal method for <a href="/facts/Specification_language/vqNInfdh">specification</a> and <a href="/facts/Program_refinement/ehdFJQ9T">refinement</a></li> <li><a href="/facts/Anders_Hejlsberg/E1GJCekr">Anders Hejlsberg</a>, original author of <a href="/facts/Turbo_Pascal/2aWFEk9z">Turbo Pascal</a>, chief architect of <a href="/facts/C_Sharp_(programming_language)/UC2gxeyb">C#</a></li> <li><a href="/facts/Laurie_Hendren/VwASWSJ1">Laurie Hendren</a>, continuous and significant contributions for 30+ years to the field of OO programming languages and compiling</li> <li><a href="/facts/Thomas_Henzinger/86BeultA">Thomas Henzinger</a>, received the <a href="/facts/Milner_Award/cRooDK01">2015 Milner Award</a> for "fundamental advances in the theory and practice of <a href="/facts/Formal_verification/BYD4GnJR">formal verification</a> and synthesis of reactive, real-time, and hybrid computer systems"</li> <li><a href="/facts/Maurice_Herlihy/QvzHk8u9">Maurice Herlihy</a>, <a href="/facts/Dijkstra_Prize/WUMmjNwF">2003, 2012, and 2022 Dijkstra Prizes</a>, one for work on <a href="/facts/Transactional_memory/N7CcDl7w">transactional memory</a></li> <li><a href="/facts/Rich_Hickey/rGr87VgF">Rich Hickey</a>, designer of <a href="/facts/Clojure/3JRNxKXx">Clojure</a></li> <li><a href="/facts/Tony_Hoare/vBeb3cmn">Tony Hoare</a>, first axiomatic basis for proving programs correct, <a href="/facts/Communicating_sequential_processes/bzKGnJ50">CSP</a>, the 1980 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for fundamental contributions to the definition and design of programming languages</li> <li><a href="/facts/Ric_Holt/xnfcaVbF">Ric Holt</a>, the <a href="/facts/Turing_programming_language/Dskr312J">Turing programming language</a>, contributions to Grok, <a href="/facts/Euclid_(programming_language)/juXVgqbg">Euclid</a>, <a href="/facts/SP%2fk/fkXYzc49">SP/k</a>, and <a href="/facts/S%2fSL/M5RwCUo5">S/SL</a></li> <li><a href="/facts/Urs_H%25C3%25B6lzle/gGsmlAl5">Urs Hölzle</a>, co-implemented <a href="/facts/Strongtalk/6DY4wfR9">Strongtalk</a>, a <a href="/facts/Smalltalk/Ru2UPVDE">Smalltalk</a> environment with optional <a href="/facts/Static_typing/Tz0bAMS9">static typing</a> support, later became Googles first Vice President of Engineering</li> <li><a href="/facts/Grace_Hopper/MEhbGazn">Grace Hopper</a>, co-designer of <a href="/facts/COBOL/wVnhqs0k">COBOL</a></li> <li><a href="/facts/Jim_Horning/HJ3yMcrS">Jim Horning</a>, interests included <a href="/facts/Programming_language/cWTYbgWa">programming languages</a>, <a href="/facts/Programming_methodology/cIDtuNPN">programming methodology</a>, <a href="/facts/Specification/xEMUsktp">specification</a>; co-developer of the <a href="/facts/Larch_family/1CVr4nNn">Larch</a> approach to <a href="/facts/Formal_specification/4q2oDkvS">formal specification</a></li> <li><a href="/facts/Susan_B._Horwitz/x0LlPwl4">Susan B. Horwitz</a>, noted for research on <a href="/facts/Programming_language/cWTYbgWa">programming languages</a> and <a href="/facts/Software_engineering/KX6cE9kz">software engineering</a>, and in particular on program slicing and dataflow-analysis</li> <li><a href="/facts/Paul_Hudak/1nvMnYtL">Paul Hudak</a>, known for involvement in designing the language <a href="/facts/Haskell/ydEsHuGy">Haskell</a>, and for several textbooks on it and <a href="/facts/Computer_music/2bS14C3D">computer music</a></li> <li><a href="/facts/G%25C3%25A9rard_Huet/127arH1z">Gérard Huet</a>, ACM SIGPLAN 2013 PL Software Award<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a> and the 2015 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the <a href="/facts/Coq_(software)/7oBXgLCE">Coq</a> proof assistant</li> <li><a href="/facts/John_Hughes_(computer_scientist)/1Mp9trs6">John Hughes</a>, PhD thesis <i>The Design and Implementation of Programming Languages</i>.,<a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a> co-developer of the <a href="/facts/QuickCheck/PSTnm0fh">QuickCheck</a> software library, <a href="/facts/List_of_fellows_of_the_Association_for_Computing_Machinery/XGNEYL9A">2018 ACM Fellow</a> for contributions to software testing and functional programming</li> <li><a href="/facts/Roger_Hui/bsYdkhWv">Roger Hui</a>, co-developed the language <a href="/facts/J_(programming_language)/EdIVMBj7">J</a></li></ul> <h2 id="i">I</h2> <ul><li><a href="/facts/Jean_Ichbiah/Jqf7PXrM">Jean Ichbiah</a>, designer the system implementation <a href="/facts/Programming_language/cWTYbgWa">programming language</a> called <a href="/facts/LIS_(programming_language)/Nm59NEHr">LIS</a>, initial chief designer of <a href="/facts/Ada_programming_language/Y2yHel4l">Ada</a></li> <li><a href="/facts/Roberto_Ierusalimschy/pPEtzl35">Roberto Ierusalimschy</a>, designer of <a href="/facts/Lua_(programming_language)/xkBCgta0">Lua</a></li> <li><a href="/facts/Dan_Ingalls/ytBrJMWc">Dan Ingalls</a>, the 2022 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> and the 1987 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/Smalltalk/Ru2UPVDE">Smalltalk</a></li> <li><a href="/facts/Kenneth_E._Iverson/2K4c4hsh">Kenneth E. Iverson</a>, the 1979 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for his pioneering effort in ... resulting in ... <a href="/facts/APL_(programming_language)/E2sb98gC">APL</a>, for his contributions to ..., ..., and programming language theory and practice</li></ul> <h2 id="j">J</h2> <ul><li><a href="/facts/Daniel_Jackson_(computer_scientist)/KA85tJYW">Daniel Jackson</a>, principal designer of the <a href="/facts/Alloy_(specification_language)/Bdk1fLBJ">Alloy</a> modelling language and its associated <a href="/facts/Alloy_Analyzer/Bdk1fLBJ">Alloy Analyzer</a> analysis tool, author of the book <i>Software Abstractions: Logic, Language, and Analysis</i></li> <li><a href="/facts/J%25C3%25B8rn_Jensen/J2pRYnJm">Jørn Jensen</a>, developed <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a> compilers, invented <a href="/facts/Jensen%2527s_device/GAfGwXBa">Jensen's device</a>, which exploits <a href="/facts/Call_by_name/Pc9kLWgs">call by name</a></li> <li><a href="/facts/Ralph_Johnson_(computer_scientist)/xp2MMydY">Ralph Johnson</a>, one of the <a href="/facts/Design_Patterns/bHvkoxsu">Gang of Four</a>, the 2006 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for ... their book <i><a href="/facts/Design_Patterns_(book)/sYDxSGc9">Design Patterns: ...</a></i>, ACM SIGPLAN 2005 PL Achievement Award<a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a></li> <li><a href="/facts/Cliff_Jones_(computer_scientist)/oKdzxwkQ">Cliff Jones</a>, the <a href="/facts/Vienna_Development_Method/ormJgInD">Vienna Development Method</a> (VDM), rely-guarantee—compositional <a href="/facts/Interference_freedom/hj5NPfv5">interference freedom</a><a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a></li> <li><a href="/facts/Neil_D._Jones/c4EvAGgW">Neil D. Jones</a>, work on <a href="/facts/Partial_evaluation/cSBKhRPo">partial evaluation</a>, ACM SIGPLAN 2014 PL Achievement Award<a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a></li> <li><a href="/facts/Simon_Peyton_Jones/SaVmBaaG">Simon Peyton Jones</a>, for work in <a href="/facts/Functional_programming/cdxqPEIM">functional programming</a> languages and <a href="/facts/Lazy_evaluation/mD3DxDkc">lazy evaluation</a>; codesigner of <a href="/facts/Haskell/ydEsHuGy">Haskell</a>; 2011 <a href="/facts/Programming_Languages_Software_Award/BoQyp9jf">Programming Languages Software Award</a> for the <a href="/facts/Glasgow_Haskell_Compiler/4msB3KFN">Glasgow Haskell Compiler</a> (GHC)</li></ul> <h2 id="k">K</h2> <ul><li><a href="/facts/Gilles_Kahn/Dc2lwjWF">Gilles Kahn</a>, coroutines and networks of processes<a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a></li> <li><a href="/facts/Ted_Kaehler/tDrQ3qfh">Ted Kaehler</a>, co-implementer of <a href="/facts/Smalltalk/Ru2UPVDE">Smalltalk</a></li> <li><a href="/facts/Ronald_Kaplan/F9WeuMdQ">Ronald Kaplan</a>, the 1992 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the <a href="/facts/Integrated_development_environment/jbEINSQf">IDE</a> called <a href="/facts/Interlisp/zSEUS17z">Interlisp</a></li> <li><a href="/facts/Stefan_Karpinski/mqmnN35w">Stefan Karpinski</a>, the 2019 <a href="/facts/J._H._Wilkinson_Prize_for_Numerical_Software/5pQ82QP5">J. H. Wilkinson Prize for Numerical Software</a> for the co-development of the <a href="/facts/Julia_(programming_language)/AoB0PJ9C">Julia</a> programming language</li> <li><a href="/facts/Alan_Kay/opDYqrcm">Alan Kay</a>, the 2003 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for pioneering many of the ideas at the root of contemporary OO programming languages, leading the team that developed <a href="/facts/Smalltalk/Ru2UPVDE">Smalltalk</a>, and ...</li> <li><a href="/facts/John_Larry_Kelly_Jr./9C2a9QjC">John Kelly</a>, co-developed the pioneer dataflow language BLODI (BLOck DIagram). See <a href="/facts/Dataflow_programming/60IdWpE1">Dataflow programming</a></li> <li><a href="/facts/John_G._Kemeny/A388Exjr">John G. Kemeny</a>, co-designer and developer the first <a href="/facts/BASIC/ELoTkjnM">BASIC</a> language</li> <li><a href="/facts/Ken_Kennedy_(computer_scientist)/QsgPp4wL">Ken Kennedy</a>, the <a href="/facts/McDowell_Award/Qy21UYnL">McDowell Award</a> for contributions to compiler optimization and ..., ACM SIGPLAN 1999 PL Achievement Award<a class="footnote-ref" id="fnref:32" href="#fn:32"><sup>32</sup></a></li> <li><a href="/facts/Brian_Kernighan/oW3I7FWJ">Brian Kernighan</a>, co-designer of <a href="/facts/AWK/lAQ0leyj">AWK</a> and <a href="/facts/AMPL/pzceW9mH">AMPL</a>, co-author of "The C Programming Language", promoter and designer of "little languages": <a href="/facts/Eqn_(software)/zM72sqq4">Eqn</a>, <a href="/facts/PIC_(markup_language)/c4R8o4tJ">Pic</a>, <a href="/facts/Grap/deKB9nwX">Grap</a></li> <li><a href="/facts/Gregor_Kiczales/68UI7JEn">Gregor Kiczales</a>, the 2012 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a>, for his work on <a href="/facts/CLOS/jM4RCgSS">CLOS</a> and the <a href="/facts/Metaobject/UgJq5A0t">MOP</a> and for spearheading aspect-orientation and <a href="/facts/AspectJ/0ctawTQj">AspectJ</a></li> <li><a href="/facts/Ken_Knowlton/FSjwexwv">Ken Knowlton</a>. computer graphics pioneer, created <a href="/facts/BEFLIX/uFqx0Iht">BEFLIX</a> for making movies and L6,<a class="footnote-ref" id="fnref:33" href="#fn:33"><sup>33</sup></a> which introduced postfix field selection to list processing</li> <li><a href="/facts/Donald_Knuth/GozNzDM6">Donald Knuth</a>, the 1974 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for his major contributions to ... and the design of programming languages, and ...</li> <li><a href="/facts/Andrew_Koenig_(programmer)/bxV8gICv">Andrew Koenig</a>, author of <a href="/facts/C_Traps_and_Pitfalls/dLfwdYog">C Traps and Pitfalls</a> and the <a href="/facts/Koenig_lookup/SdqQE9DD">Koenig lookup</a></li> <li><a href="/facts/Michael_K%25C3%25B6lling/Q5sxvMN7">Michael Kölling</a>, development of <a href="/facts/BlueJ/XSpXcUvL">BlueJ</a> and <a href="/facts/Greenfoot/ecmUK3Du">Greenfoot</a></li> <li><a href="/facts/Kees_Koster/kIfW8A49">Kees Koster</a>, co-designer of <a href="/facts/ALGOL_68/NTnc9fy7">ALGOL 68</a>, creator of <a href="/facts/Affix_grammar/62bYM9Nq">affix grammars</a>, creator of the original <a href="/facts/Compiler_Description_Language/xGNVxUok">Compiler Description Language (CDL)</a></li> <li><a href="/facts/Robert_Kowalski/vT4Npm2x">Robert Kowalski</a>, the <a href="/facts/IJCAI_Award_for_Research_Excellence/WQ7lXQ87">2011 IJCAI Award for Research Excellence</a> for ... pioneering work on ... <a href="/facts/Logic_programming/Xgh8lj3F">logic programming</a>; introduced <a href="/facts/SLD_resolution/TlE5h5p0">SLD resolution</a>, which is used in the implementation of the logic programming language <a href="/facts/Prolog/r5h66Qh1">Prolog</a></li> <li><a href="/facts/Dexter_Kozen/c5Nspr5d">Dexter Kozen</a>, one of the fathers of <a href="/facts/Dynamic_logic_(modal_logic)/TrTa7Jty">dynamic logic</a>, an extension of <a href="/facts/Modal_logic/I7uXvYYT">modal logic</a> capable of encoding properties of <a href="/facts/Computer_program/e38jH9N9">computer programs</a></li> <li><a href="/facts/Shriram_Krishnamurthi/LnGpGvtH">Shriram Krishnamurthi</a>, developed <a href="/facts/Flapjax/wG6M3yXl">Flapjax</a>, ACM SIGPLAN 2018 PL Software Award<a class="footnote-ref" id="fnref:34" href="#fn:34"><sup>34</sup></a> for <a href="/facts/Racket_(programming_language)/5n7LW08b">Racket</a>, the 2012 ACM <a href="/facts/SIGPLAN/BoQyp9jf">SIGPLAN</a> Robin Milner Young Researcher Award<a class="footnote-ref" id="fnref:35" href="#fn:35"><sup>35</sup></a></li> <li><a href="/facts/David_Kuck/9j8eBDVo">David Kuck</a>, the IEEE Computer Society 2011 <a href="/facts/Computer_Pioneer_Award/9PKCGf5W">Computer Pioneer Award</a> for revolutionary parallel compiler technology including Parafrase (in 1977)<a class="footnote-ref" id="fnref:36" href="#fn:36"><sup>36</sup></a> and KAP Tools</li> <li><a href="/facts/Thomas_E._Kurtz/Qq8PIore">Thomas E. Kurtz</a>, co-designer and developer the first <a href="/facts/BASIC/ELoTkjnM">BASIC</a> language</li></ul> <h2 id="l">L</h2> <ul><li><a href="/facts/Monica_S._Lam/Tbx1zmgP">Monica S. Lam</a>, contributed to a wide range of topics including <a href="/facts/Compiler/WNfCDFJe">compilers</a> and <a href="/facts/Program_analysis/oaJTAjhH">program analysis</a>, received the ACM Most Influential PLDI Paper Award in 2001<a class="footnote-ref" id="fnref:37" href="#fn:37"><sup>37</sup></a><a class="footnote-ref" id="fnref:38" href="#fn:38"><sup>38</sup></a></li> <li><a href="/facts/Leslie_Lamport/jGCarz9C">Leslie Lamport</a>, creator of the formal specification language <a href="/facts/TLA%252B/cy4IfLBa">TLA+</a> and much more, the 2013 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a></li> <li><a href="/facts/Peter_Landin/V7dtseWL">Peter Landin</a> used the <a href="/facts/Lambda_calculus/DaD3RuQ4">lambda calculus</a> to model <a href="/facts/ISWIM/fSMk6YbA">ISWIM</a>, in doing so defined the <a href="/facts/Off-side_rule/LmengNTS">off-side rule</a> and coined the term <a href="/facts/Syntactic_sugar/FYkNSdTI">syntactic sugar</a>; active in defining <a href="/facts/ALGOL/mw03yQdn">ALGOL</a></li> <li><a href="/facts/Richard_H._Lathwell/pfSvP74z">Richard H. Lathwell</a>, the 1973 <a href="/facts/Grace_Murray_Hopper_Award/QWm4lPuk">Grace Murray Hopper Award</a> for the design and implementation of <a href="/facts/APL_(programming_language)/E2sb98gC">APL</a>\360</li> <li><a href="/facts/Chris_Lattner/tFpzvnlQ">Chris Lattner</a>, designer of <a href="/facts/Swift_(programming_language)/A7qHQC32">Swift</a>, ACM SIGPLAN 2010 PL Software Award<a class="footnote-ref" id="fnref:39" href="#fn:39"><sup>39</sup></a> and the 2012 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/LLVM/nPmcspQN">LLVM</a>, a set of <a href="/facts/Compiler/WNfCDFJe">compiler</a> and <a href="/facts/Toolchain/SmlWCJhY">toolchain</a> technologies</li> <li><a href="/facts/John_Launchbury/uBvSorb3">John Launchbury</a>, lazy functional languages, contributing designer of <a href="/facts/Haskell/ydEsHuGy">Haskell</a>, directed development of the <a href="/facts/Domain-specific_language/n18H1foD">domain-specific language</a> named <a href="/facts/Cryptol/PSs4kFAQ">Cryptol</a></li> <li><a href="/facts/Harold_Lawson/Ae8DELbr">Harold Lawson</a>, the IEEE Computer Society 2000 <a href="/facts/Computer_Pioneer_Award/9PKCGf5W">Computer Pioneer Award</a> for inventing the pointer variable and introducing this concept into <a href="/facts/PL%2fI/469mVYgd">PL/I</a></li> <li><a href="/facts/Doug_Lea/E6lgk8NA">Doug Lea</a>, the 2010 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a>, for tireless advocacy of object-oriented techniques, contributions to concurrent programming in Java, and ...</li> <li><a href="/facts/Peter_Lee_(computer_scientist)/48BTBdlC">Peter Lee</a>, PhD thesis: <i>The automatic generation of realistic compilers from high-level semantic descriptions</i>; as of 2022, Microsoft Corporate Vice President, Research and Incubations</li> <li><a href="/facts/Rasmus_Lerdorf/kIA4GNwF">Rasmus Lerdorf</a>, father of <a href="/facts/PHP/02Lfe6RM">PHP</a></li> <li><a href="/facts/Xavier_Leroy/bkfT2DpR">Xavier Leroy</a>, the 2016 <a href="/facts/Milner_Award/cRooDK01">Milner Award</a> for exceptional achievements in programming including <a href="/facts/OCaml/ThBGLND8">OCaml</a>, ACM SIGPLAN 2021 PL Software Award<a class="footnote-ref" id="fnref:40" href="#fn:40"><sup>40</sup></a></li> <li><a href="/facts/Charles_H._Lindsey/1tu7krTS">Charles H. Lindsey</a>, co-editor of the Revised Report on <a href="/facts/Algol_68/NTnc9fy7">Algol 68</a>, designed an implemented <a href="/facts/ALGOL_68S/KqX8jtyx">ALGOL 68S</a>, a subset of Algol 68, wrote the complete History of ALGOL 68 in<a class="footnote-ref" id="fnref:41" href="#fn:41"><sup>41</sup></a></li> <li><a href="/facts/Barbara_Liskov/EgjpztD5">Barbara Liskov</a>, the 2008 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for contributions to practical and theoretical foundations of programming language and system design, ...</li> <li><a href="/facts/Yanhong_Annie_Liu/bVID1xSv">Yanhong Annie Liu</a>, PhD thesis on incremental computation,<a class="footnote-ref" id="fnref:42" href="#fn:42"><sup>42</sup></a> book on systematic program design<a class="footnote-ref" id="fnref:43" href="#fn:43"><sup>43</sup></a></li> <li><a href="/facts/Peter_Lucas_(computer_scientist)/TDMAvDLs">Peter Lucas</a>, formal definition of <a href="/facts/PL%2fI/469mVYgd">PL/I</a>, the <a href="/facts/Vienna_Development_Method/ormJgInD">Vienna Development Method</a> (VDM), work on the <a href="/facts/Functional_programming/cdxqPEIM">functional programming</a> language <a href="/facts/FL_(programming_language)/EahaIaDo">FL</a></li> <li><a href="/facts/David_Luckham/mrjgyeVV">David Luckham</a>, contributions to <a href="/facts/Lisp_(programming_language)/xJHA3CrX">Lisp</a> and verification of <a href="/facts/Pascal_(programming_language)/b3yvp8bF">Pascal</a>; cofounder of the <a href="/facts/Ada_(programming_language)/Y2yHel4l">Ada compiler</a></li></ul> <h2 id="m">M</h2> <ul><li><a href="/facts/Simon_Marlow/cB5L1czA">Simon Marlow</a>, ACM SIGPLAN 2011 PL Software Award<a class="footnote-ref" id="fnref:44" href="#fn:44"><sup>44</sup></a> for the <a href="/facts/Glasgow_Haskell_Compiler/4msB3KFN">Glasgow Haskell Compiler</a></li> <li><a href="/facts/Larry_Masinter/GuKjgjhB">Larry Masinter</a>, the 1992 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the <a href="/facts/Integrated_development_environment/jbEINSQf">IDE</a> named <a href="/facts/Interlisp/zSEUS17z">Interlisp</a></li> <li><a href="/facts/Yukihiro_Matsumoto/hjveNJkj">Yukihiro Matsumoto</a>, designer of <a href="/facts/Ruby_(programming_language)/BeYSaPSR">Ruby</a></li> <li><a href="/facts/David_May_(computer_scientist)/zmIFjGeP">David May</a>, lead designer of <a href="/facts/Occam_(programming_language)/5EWXeIKY">occam</a></li> <li><a href="/facts/Conor_McBride/lUeSX59n">Conor McBride</a>, researches <a href="/facts/Type_theory/xj0xzVqI">type theory</a>, <a href="/facts/Functional_programming/cdxqPEIM">functional programming</a>; with James McKinna, cocreated <a href="/facts/Epigram_(programming_language)/br3xLmlR">Epigram (programming language)</a>; member <a href="/facts/IFIP_Working_Group_2.1/JhPYRM7c">IFIP Working Group 2.1</a> on Algorithmic Languages and Calculi</li> <li><a href="/facts/John_McCarthy_(computer_scientist)/ajKU4SdD">John McCarthy</a>, the <a href="/facts/Lisp_(programming_language)/xJHA3CrX">Lisp family of programming languages</a>, the 1971 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a></li> <li><a href="/facts/Douglas_McIlroy/6WowR6Lr">Douglas McIlroy</a>, pioneering researcher of <a href="/facts/Macro_processor/fFKXWVUT">macro processors</a> and programming language <a href="/facts/Extensibility/AEPWNwxp">extensibility</a>, contributed to designing <a href="/facts/PL%2fI/469mVYgd">PL/I</a>, <a href="/facts/SNOBOL/cdF7ezMJ">SNOBOL</a>, <a href="/facts/ALTRAN/5HwovYJK">ALTRAN</a>, <a href="/facts/TMG_(language)/eDEYHIXx">TMG</a>, <a href="/facts/C%252B%252B/Et0F2qn9">C++</a></li> <li><a href="/facts/Kathryn_S._McKinley/5X14EPmX">Kathryn S. McKinley</a>, research on <a href="/facts/Compiler/WNfCDFJe">compilers</a>, runtime systems, and <a href="/facts/Computer_architecture/tHtwxgR2">computer architecture</a>, introduced the <a href="/facts/Hoard_memory_allocator/jnTmLvS4">Hoard C/C++ Memory Allocator</a>, the ACM SIGPLAN 2012 PL Software Award<a class="footnote-ref" id="fnref:45" href="#fn:45"><sup>45</sup></a> for Jikes RVM</li> <li><a href="/facts/Lambert_Meertens/cowSqqhC">Lambert Meertens</a>, co-designer of <a href="/facts/ABC_(programming_language)/lgYVS5y4">ABC</a>, the incidental predecessor of <a href="/facts/Python_(programming_language)/YbuGqofa">Python</a>; co-designer of the <a href="/facts/Bird%25E2%2580%2593Meertens_formalism/Us3fvK6D">Bird–Meertens formalism</a>; co-editor of the Revised <a href="/facts/ALGOL_68/NTnc9fy7">ALGOL 68</a> Report</li> <li><a href="/facts/Erik_Meijer_(computer_scientist)/kRYtaSGd">Erik Meijer</a>, works on <a href="/facts/Functional_programming/cdxqPEIM">functional programming</a> (particularly <a href="/facts/Haskell/ydEsHuGy">Haskell</a>), <a href="/facts/Compiler/WNfCDFJe">compiler</a> implementation, <a href="/facts/Parsing/nRKB01S3">parsing</a>, and <a href="/facts/Programming_language_design/cWTYbgWa">programming language design</a></li> <li><a href="/facts/Bertrand_Meyer/fHywGneP">Bertrand Meyer</a>, created <a href="/facts/Eiffel_(programming_language)/gEzPjzmn">Eiffel</a> and advocated <a href="/facts/Design_by_contract/PjacMRRd">design by contract</a>, awarded the 2005 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a></li> <li><a href="/facts/Harlan_Mills/vwoXQcgB">Harlan Mills</a>, the IEEE Computer Society 1994 <a href="/facts/Computer_Pioneer_Award/9PKCGf5W">Computer Pioneer Award</a> for <a href="/facts/Structured_programming/zA8b8dP1">structured programming</a></li> <li><a href="/facts/Robin_Milner/oMfdsRwK">Robin Milner</a>, the 1991 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for three distinct and complete achievements: (1)...; (2) <a href="/facts/ML_(programming_language)/RfwxASRF">ML</a>, the first language to include polymorphic type inference together with a type-safe exception-handling mechanism; (3) <a href="/facts/Calculus_of_communicating_systems/0FNkQbug">CCS</a>, ...</li> <li><a href="/facts/Jayadev_Misra/nfgR4Lw3">Jayadev Misra</a>, contributions to concurrent programming, including the languages <a href="/facts/UNITY_(programming_language)/HedwxILy">UNITY</a> and <a href="https://orc.csres.utexas.edu/">"Orc"</a>.</li> <li><a href="/facts/James_G._Mitchell/JY1r2M0A">James G. Mitchell</a>, work on the <a href="/facts/WATFIV/4bSfYvEx">WATFOR</a> compiler, languages <a href="/facts/Mesa_(programming_language)/etxwQkV5">Mesa</a> and <a href="/facts/Euclid_(programming_language)/juXVgqbg">Euclid</a>, PhD thesis on <i>The design and construction of flexible and efficient interactive programming systems</i></li> <li><a href="/facts/John_C._Mitchell/8tzw9FNg">John C. Mitchell</a> explored the connection between <a href="/facts/Existential_type/Tz0bAMS9">existential types</a> and <a href="/facts/Abstract_data_type/BaVGSHNP">abstract data types</a> and played a pivotal role in developing type theory as a foundation for programming languages</li> <li><a href="/facts/Arvind_(computer_scientist)/2CRcoFbV">Arvind Mithal</a>, for parallel languages <i>Id</i> and <i>pH</i>, compiling on parallel machines, and language <a href="/facts/Bluespec/INcoF6XJ">Bluespec</a> <a href="/facts/SystemVerilog/wkBdc179">SystemVerilog</a> (BSV)</li> <li><a href="/facts/Calvin_Mooers/CtXK3YfW">Calvin Mooers</a>, the language <a href="/facts/TRAC_(programming_language)/8EB5dXFQ">TRAC</a></li> <li><a href="/facts/Charles_H._Moore/9rsgu4PF">Charles H. Moore</a> (Chuck), the language <a href="/facts/Forth_(programming_language)/mYtWVNhF">Forth</a></li> <li><a href="/facts/Roger_Moore_(computer_scientist)/oN2fK3yX">Roger D. Moore</a>, implemented <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a>, the 1973 <a href="/facts/Grace_Murray_Hopper_Award/QWm4lPuk">Grace Murray Hopper Award</a> for the design and implementation <a href="/facts/APL_(programming_language)/E2sb98gC">APL</a>\360</li> <li><a href="/facts/Carroll_Morgan_(computer_scientist)/A4jn2muQ">Carroll Morgan</a>, known proponent of the <a href="/facts/Refinement_calculus/N7PM9L7G">refinement calculus</a> approach to program development; authored the book <i><a href="http://web.comlab.ox.ac.uk/oucl/publications/books/PfS/">Programming from Specifications</a></i></li> <li><a href="/facts/James_H._Morris/HaFJpDbE">James H. Morris</a> developed two underlying principles of programming languages, inter-module protection and <a href="/facts/Lazy_evaluation/mD3DxDkc">lazy evaluation</a>, and led the <a href="/facts/Mesa_(programming_language)/etxwQkV5">Cedar programming environment</a> project</li> <li><a href="/facts/Greg_Morrisett/dMszECjS">Greg Morrisett</a>, worked on <a href="/facts/Type_system/Tz0bAMS9">type systems</a> and <a href="/facts/Proof-carrying_code/C9shJh1p">proof-carrying code</a> and <a href="/facts/Provably_secure/2kQS1WId">provably secure</a> systems, created <a href="/facts/Cyclone_(programming_language)/q1guP1jf">Cyclone</a>, POPL 1998 Most Influential Paper Award<a class="footnote-ref" id="fnref:46" href="#fn:46"><sup>46</sup></a> for applying type system ideas to low level programming</li> <li><a href="/facts/J._Eliot_B._Moss/QbG51AAm">J. Eliot B. Moss</a>, active in the fields of <a href="/facts/Garbage_collection_(computer_science)/j2vlIu7g">garbage collection</a> and <a href="/facts/Multiprocessor/aDCfehDQ">multiprocessor</a> <a href="/facts/Synchronization_(computer_science)/n7ID76uM">synchronization</a>, co-inventor of <a href="/facts/Transactional_memory/N7CcDl7w">transactional memory</a></li> <li><a href="/facts/Alan_Mycroft/AeQBnmhM">Alan Mycroft</a>, research in programming languages, co-created the <a href="/facts/Norcroft_C_compiler/I4kacbsQ">Norcroft C compiler</a></li> <li><a href="/facts/Brad_A._Myers/lFYcaeW3">Brad A. Myers</a>, for the Natural Programming project, focusing on programming languages programming languages and making programming easier and more correct by making it more natural.<a class="footnote-ref" id="fnref:47" href="#fn:47"><sup>47</sup></a></li></ul> <h2 id="n">N</h2> <ul><li><a href="/facts/Peter_Naur/S1X7AHfj">Peter Naur</a>, the 2005 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for fundamental contributions to programming language design and the definition of <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a>, to compiler design, and to ...</li> <li><a href="/facts/George_Necula/Jjq25mj2">George Necula</a>, POPL 1997 and 2002 Most Influential Paper Award<a class="footnote-ref" id="fnref:48" href="#fn:48"><sup>48</sup></a> for <a href="/facts/Proof-carrying_code/C9shJh1p">proof-carrying code</a> and type-safe retrofitting of legacy code</li> <li><a href="/facts/Bruce_Jay_Nelson/dn4etbM6">Bruce Nelson</a>, the 1994 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the <a href="/facts/Remote_procedure_call/uMMb9CQw">remote procedure call</a> concept</li> <li><a href="/facts/Greg_Nelson_(computer_scientist)/vd8D8rR1">Greg Nelson</a>, PhD thesis <i>Techniques for Program Verification</i>, co-designer of <a href="/facts/Modula-3/RbblULyn">Modula-3</a>, the <a href="/facts/Herbrand_Award/azY2vCYR">2013 Herbrand Award</a> for pioneering contributions to theorem proving and program verification ...</li> <li><a href="/facts/Oscar_Nierstrasz/n75xuGQo">Oscar Nierstrasz</a>, the 2013 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for ... contributions ... aimed at making systems more flexible with respect to changing requirements, based on programming languages and mechanisms supporting software evolution</li> <li><a href="/facts/Maurice_Nivat/l5GtJaYb">Maurice Nivat</a>, research in <a href="/facts/Formal_languages/crDTyP8q">formal languages</a> and <a href="/facts/Programming_language_semantics/JEP1zyBv">programming language semantics</a>; received the 2002 <a href="/facts/European_Association_for_Theoretical_Computer_Science/4jlopeDl">EATCS award</a></li> <li><a href="/facts/James_Noble_(computer_scientist)/P24GmW0v">James Noble</a>, the 2016 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for a world-leading reputation for work on object-orientation; did pioneering work in novel type systems for programming languages</li> <li><a href="/facts/Kristen_Nygaard/2h3KoI8B">Kristen Nygaard</a>, the 2001 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for ideas fundamental to the emergence of OO programming, through [the] design of <a href="/facts/Simula/gaEVG7SL">Simula</a> I and 67</li></ul> <h2 id="o">O</h2> <ul><li><a href="/facts/Martin_Odersky/fWmg60WX">Martin Odersky</a>, provided basis for <a href="/facts/Javac/PhoCVLnM">javac</a>, co-developed <a href="/facts/Generics_in_Java/j8nFhEKq">Generics in Java</a>, ACM SIGPLAN 2019 PL Software Award<a class="footnote-ref" id="fnref:49" href="#fn:49"><sup>49</sup></a> for <a href="/facts/Scala_(programming_language)/ebL8o6AK">Scala</a></li> <li><a href="/facts/Peter_O%2527Hearn/pfsJwFNe">Peter O'Hearn</a>, known for <a href="/facts/Separation_logic/KXLDW7Ma">separation logic</a>, co-developed the <a href="/facts/Static_program_analysis/b56nr6QM">static program analysis</a> utility <a href="/facts/Infer_Static_Analyzer/Yf2AUx0c">Infer Static Analyzer</a>, 2001 Most Influential Paper Award<a class="footnote-ref" id="fnref:50" href="#fn:50"><sup>50</sup></a></li> <li><a href="/facts/John_Ousterhout/VEgPbRVQ">John Ousterhout</a>, the 1997 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/Tcl/s7fbKYtR">Tcl</a>/<a href="/facts/Tk_(software)/Y6NBxcbF">Tk</a></li> <li><a href="/facts/Susan_Owicki/NMvzu2qK">Susan Owicki</a>, contributions to semantics, e.g. <a href="/facts/Interference_freedom/hj5NPfv5">Interference freedom</a> and<a class="footnote-ref" id="fnref:51" href="#fn:51"><sup>51</sup></a></li></ul> <h2 id="p">P</h2> <ul><li><a href="/facts/Krishna_Palem/5pWpL3g3">Krishna Palem</a>, the <a href="/facts/W._Wallace_McDowell_Award/Qy21UYnL">2008 McDowell Award</a>, for pioneering contributions to the algorithmic, compilation, and architectural foundations of embedded computing</li> <li><a href="/facts/David_Park_(computer_scientist)/VNIYNVSb">David Park</a>, worked on the first implementation of <a href="/facts/Lisp_(programming_language)/xJHA3CrX">Lisp</a>, an authority on the topics of fairness, program schemas and <a href="/facts/Bisimulation/mqupHSps">bisimulation</a> in <a href="/facts/Concurrent_computing/yVzQBPr9">concurrent computing</a></li> <li><a href="/facts/David_Parnas/1zPw1V0m">David Parnas</a>, developed <a href="/facts/Information_hiding/dnSDPMaz">information hiding</a>, an important element of <a href="/facts/Object-oriented_programming/TxNMEcao">OO programming</a> today.</li> <li><a href="/facts/Christine_Paulin-Mohring/UVdvFThg">Christine Paulin-Mohring</a>, ACM SIGPLAN 2013 PL Software Award<a class="footnote-ref" id="fnref:52" href="#fn:52"><sup>52</sup></a> and the 2015 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/Coq_proof_assistant/7oBXgLCE">Coq</a></li> <li>Manfred Paul, Thesis: On the Structure of Formal Languages (1962, German); co-developer of Alcor-Illinois <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a> compiler</li> <li><a href="/facts/Lawrence_Paulson/kt3dnAkn">Lawrence Paulson</a>, known for the text <i><a href="/facts/ML_(programming_language)/RfwxASRF">ML</a> for the Working Programmer</i> and the interactive theorem prover <a href="/facts/Isabelle_(proof_assistant)/CNbtbX83">Isabelle</a>, which he introduced in 1986</li> <li><a href="/facts/Steven_Pemberton/FKLBHstq">Steven Pemberton</a>, co-designer of <a href="/facts/ABC_(programming_language)/lgYVS5y4">ABC</a>, the incidental predecessor of <a href="/facts/Python_(programming_language)/YbuGqofa">Python</a>; contributing author of HyperText Markup Language (<a href="/facts/HTML/sSc3fT78">HTML</a>)</li> <li><a href="/facts/Alan_Perlis/yKMjm7gP">Alan Perlis</a>, first <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> recipient, 1966, for ... and compiler construction, <a href="/facts/ALGOL_58/CbHqs9GR">ALGOL 58</a></li> <li><a href="/facts/Carl_Adam_Petri/oT2q6jXA">Carl Adam Petri</a>, the IEEE Computer Society 2008 <a href="/facts/Computer_Pioneer_Award/9PKCGf5W">Computer Pioneer Award</a> for <a href="/facts/Petri_net/BK7eTHNm">Petri net</a> theory and then parallel and distributed computing</li> <li><a href="/facts/Benjamin_C._Pierce/m9DKUgML">Benjamin C. Pierce</a>, for contributions to the theory and practice of programming languages and their type systems, the author of a book on <a href="/facts/Type_systems/Tz0bAMS9">type systems</a> titled <i><a href="/facts/Types_and_Programming_Languages/vrEw2McI">Types and Programming Languages</a></i></li> <li><a href="/facts/Rob_Pike/K5R9UoSH">Rob Pike</a>, co-designer of <a href="/facts/Newsqueak/23L0hhUE">Newsqueak</a>, <a href="/facts/Limbo_(programming_language)/b6cv0H2n">Limbo</a>, and <a href="/facts/Go_(programming_language)/oWlsmAFJ">Go</a></li> <li><a href="/facts/Keshav_K_Pingali/pwKM0PtK">Keshav K Pingali</a>, <a href="/facts/International_Parallel_and_Distributed_Processing_Symposium/Bth1oYdH">2023 Computer Society Charles Babbage Award</a>, for contributions to high-performance compilers and graph computing</li> <li><a href="/facts/Gordon_Plotkin/2CrnVkVj">Gordon Plotkin</a>, for <a href="/facts/Operational_semantics/G24LXz6e">structural operational semantics</a> (SOS) and <a href="/facts/Denotational_semantics/yRs3ygRA">denotational semantics</a>; the <a href="/facts/Milner_Award/cRooDK01">2012 Milner Award</a>, the ACM SIGPLAN 2010 PL Achievement Award<a class="footnote-ref" id="fnref:53" href="#fn:53"><sup>53</sup></a></li> <li><a href="/facts/Amir_Pnueli/qJ7mMEXm">Amir Pnueli</a>, the 1996 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for seminal work introducing temporal logic into computing science and for outstanding contributions to program and systems verification</li> <li><a href="/facts/Robin_Popplestone/Cnyg3DaI">Robin Popplestone</a>, <a href="/facts/COWSEL/BPkvM4xu">COWSEL</a> (renamed POP-1), <a href="/facts/POP-2/5hdL9dPY">POP-2</a>, <a href="/facts/POP-11/CzAgWBy1">POP-11</a> languages, <a href="/facts/Poplog/I5wlXhch">Poplog</a> <a href="/facts/Integrated_development_environment/jbEINSQf">IDE</a>; <a href="/facts/Freddy_II/gHfoPduI">Freddy II</a> robot</li> <li><a href="/facts/Cicely_Popplewell/nDsRQNQz">Cicely Popplewell</a>, co-designer of software for <a href="/facts/Manchester_Mark_1/S8wpt6U5">Manchester Mark 1</a></li> <li><a href="/facts/Vaughan_Pratt/w8XlQrpl">Vaughan Pratt</a>, developed <a href="/facts/Dynamic_logic_(modal_logic)/TrTa7Jty">dynamic logic</a>, used in <a href="/facts/Formal_verification/BYD4GnJR">formal verification</a> of programs, and <a href="/facts/Pratt_parsing/YHfocsFq">Pratt parsing</a>, used in his syntax <a href="/facts/CGOL/beelnsym">CGOL</a> for <a href="/facts/Lisp_(programming_language)/xJHA3CrX">Lisp</a></li> <li><a href="/facts/William_Pugh_(computer_scientist)/513GduTm">William Pugh</a>, co-author of the <a href="/facts/Static_code_analysis/b56nr6QM">static code analysis</a> tool <a href="/facts/FindBugs/XpckAPDp">FindBugs</a>, influential in the development of the <a href="/facts/Java_Memory_Model/C0Cous7P">Java Memory Model</a></li></ul> <h2 id="r">R</h2> <ul><li><a href="/facts/George_Radin/ozJBE9pw">George Radin</a>, first among equals designing <a href="/facts/PL%2fI/469mVYgd">PL/I</a></li> <li><a href="/facts/Brian_Randell/mp6nJuP4">Brian Randell</a>, in 1964, implemented the <a href="/facts/Algol_60/QnpxUYQm">Algol 60</a> <a href="/facts/Whetstone_(benchmark)/Vje1sVrJ">Whetstone compiler</a><a class="footnote-ref" id="fnref:54" href="#fn:54"><sup>54</sup></a></li> <li><a href="/facts/John_Reif/q0e7NWr9">John Reif</a>, the Proteus language and system for the development of parallel applications<a class="footnote-ref" id="fnref:55" href="#fn:55"><sup>55</sup></a></li> <li><a href="/facts/Thomas_W._Reps/uuNEL4ch">Thomas W. Reps</a>, co-developed the early (1978) <a href="/facts/Integrated_Development_Environment/jbEINSQf">IDE</a> <i>the Cornell Program Synthesizer</i>,<a class="footnote-ref" id="fnref:56" href="#fn:56"><sup>56</sup></a> co-founded <a href="/facts/GrammaTech/NEfUkpE7">GrammaTech</a>, which developed <a href="/facts/CodeSonar/DNwyMC8F">CodeSonar</a>, ACM SIGPLAN 2017 PL Achievement Award<a class="footnote-ref" id="fnref:57" href="#fn:57"><sup>57</sup></a></li> <li><a href="/facts/Mitchel_Resnick/NUVMASFa">Mitchel Resnick</a>, developed the <a href="/facts/Visual_programming_language/j0eyIPzU">visual programming language</a> called <a href="/facts/Scratch_(programming_language)/vNfuSb2L">Scratch</a></li> <li><a href="/facts/John_C._Reynolds/6cdgIrBx">John C. Reynolds</a>, invented <a href="/facts/Polymorphic_lambda_calculus/odpwVpAG">polymorphic lambda calculus (System F)</a>, clarified early work on <a href="/facts/Continuation/53gyBXrB">continuations</a>, introduced <a href="/facts/Defunctionalization/tjyWj53L">defunctionalization</a>, worked on a <a href="/facts/Separation_logic/KXLDW7Ma">separation logic</a>, ACM SIGPLAN 2003 PL Achievement Award<a class="footnote-ref" id="fnref:58" href="#fn:58"><sup>58</sup></a></li> <li><a href="/facts/Martin_Richards_(computer_scientist)/rGwFp9Uh">Martin Richards</a>, the IEEE Computer Society 2003 <a href="/facts/Computer_Pioneer_Award/9PKCGf5W">Computer Pioneer Award</a> for the design and implementation of <a href="/facts/BCPL/GkBV2hXy">BCPL</a></li> <li><a href="/facts/Dennis_Ritchie/I1yu1UWU">Dennis Ritchie</a>, designer of <a href="/facts/C_(programming_language)/Ky2No763">C</a>, the 1983 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a></li> <li><a href="/facts/Douglas_T._Ross/wKbeMNbA">Douglas T. Ross</a>, father of the programming language <a href="/facts/APT_(programming_language)/eoRKdGbX">APT</a> for driving <a href="/facts/Numerical_control/B2c7UbaX">numerical control</a>, designed and implemented <a href="/facts/ALGOL_X/u31Ev9tQ">ALGOL X</a></li> <li><a href="/facts/Guido_van_Rossum/xADcJVjl">Guido van Rossum</a>, designer of <a href="/facts/Python_(programming_language)/YbuGqofa">Python</a></li> <li><a href="/facts/Barbara_G._Ryder/qVTQaeJl">Barbara G. Ryder</a>, extensive work on Java and Javascript, e.g.<a class="footnote-ref" id="fnref:59" href="#fn:59"><sup>59</sup></a><a class="footnote-ref" id="fnref:60" href="#fn:60"><sup>60</sup></a></li></ul> <h2 id="s">S</h2> <ul><li><a href="/facts/Klaus_Samelson/l2JMyT6d">Klaus Samelson</a>, pioneer in <a href="/facts/Compiler/WNfCDFJe">compilers</a> for <a href="/facts/Programming_language/cWTYbgWa">programming languages</a> and <a href="/facts/Stack_(abstract_data_type)/bj7l94v1">push-pop stack</a> algorithms, <a href="/facts/Algol_60/QnpxUYQm">Algol 60 Committee</a>, see also<a class="footnote-ref" id="fnref:61" href="#fn:61"><sup>61</sup></a></li> <li><a href="/facts/Jean_Sammet/cYLAq0M4">Jean Sammet</a>, developed <a href="/facts/FORMAC/jEVUddGx">FORMAC</a>, one of the developers of <a href="/facts/COBOL/wVnhqs0k">COBOL</a></li> <li><a href="/facts/Carl_Sassenrath/vzFLdCLk">Carl Sassenrath</a>, designer and implementor of <a href="/facts/Rebol/9ooWy78f">Rebol</a></li> <li><a href="/facts/Fred_B._Schneider/DlChfFTT">Fred B. Schneider</a>, defined <a href="/facts/Liveness/hFd5W0uN">liveness</a> (as opposed to <a href="/facts/Safety_and_liveness_properties/vBWq8Sdb">safety</a>), contributions to assertional methods for developing concurrent and distributed programs<a class="footnote-ref" id="fnref:62" href="#fn:62"><sup>62</sup></a></li> <li><a href="/facts/Jacob_T._Schwartz/UAvyPwCr">Jacob T. Schwartz</a>, designer of <a href="/facts/SETL/VF8l7bME">SETL</a> and <a href="/facts/Artspeak/ULLKveQm">Artspeak</a></li> <li><a href="/facts/Ilya_Sergey/qPzCaAl0">Ilya Sergey</a>, for the language Scilla<a class="footnote-ref" id="fnref:63" href="#fn:63"><sup>63</sup></a> and work on <a href="https://kuleuven.limo.libis.be/discovery/fulldisplay?docid=lirias1655948&context=SearchWebhook&vid=32KUL_KUL:Lirias&search_scope=lirias_profile&tab=LIRIAS&adaptor=SearchWebhook&lang=en">"Operational Aspects of Type Systems"</a>.</li> <li><a href="/facts/Ravi_Sethi/azn7Qhy8">Ravi Sethi</a>, best known as co-author of the <a href="/facts/Compilers%3a_Principles%2c_Techniques%2c_and_Tools/gzmzbdml">Dragon Book</a>, 1996 <a href="/facts/ACM_Fellow/kEuoGr62">ACM Fellow</a> for contributions to compiler technology, <a href="/facts/Programming_language/cWTYbgWa">programming languages</a>, ...</li> <li><a href="/facts/Viral_B._Shah/NGsaycjv">Viral B. Shah</a>, the 2019 <a href="/facts/J._H._Wilkinson_Prize_for_Numerical_Software/5pQ82QP5">J. H. Wilkinson Prize for Numerical Software</a> for the co-development of the language <a href="/facts/Julia_(programming_language)/AoB0PJ9C">Julia</a></li> <li><a href="/facts/Brian_Cantwell_Smith/IsP3gPSL">Brian Cantwell Smith</a>, introduced the notion of <a href="/facts/Reflective_programming/Nj8stFfp">reflective programming</a> in <a href="/facts/Programming_language/cWTYbgWa">programming languages</a></li> <li><a href="/facts/David_Canfield_Smith/DbrV65CD">David Canfield Smith</a>, co-developer of the <a href="/facts/Visual_programming_language/j0eyIPzU">visual programming language</a> named <a href="/facts/Stagecast_Creator/rQA1tvhK">Stagecast Creator</a> based on the concept of <a href="/facts/Programming_by_example/p3Qo41Kb">programming by example</a></li> <li><a href="/facts/Mary_Lou_Soffa/WTY9brqy">Mary Lou Soffa</a>, research on <a href="/facts/Compiler/WNfCDFJe">compilers</a> and <a href="/facts/Program_optimization/nXz6RpRM">program optimization</a> and more, <a href="/facts/Ken_Kennedy_Award/zm9MpFpN">2012 Ken Kennedy Award</a></li> <li><a href="/facts/Richard_Stallman/hhoPN0Mw">Richard Stallman</a>, the 2015 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the <a href="/facts/GNU_Compiler_Collection/t07jh01k"> GNU Compiler Collection (GCC)</a></li> <li><a href="/facts/Guy_L._Steele%2c_Jr./amHwRA1l">Guy L. Steele, Jr.</a>, co-designer of <a href="/facts/Scheme_(programming_language)/0aGdf3SC">Scheme</a> and designer of <a href="/facts/Fortress_(programming_language)/7CYvHCCk">Fortress</a>, ACM SIGPLAN 1997 PL Achievement Award<a class="footnote-ref" id="fnref:64" href="#fn:64"><sup>64</sup></a></li> <li><a href="/facts/Alexander_Stepanov/znVUvH2I">Alexander Stepanov</a>, advocate of <a href="/facts/Generic_programming/kqtqJk7p">generic programming</a>, main designer and implementer of the C++ <a href="/facts/Standard_Template_Library/IxqpRzWU">Standard Template Library</a></li> <li><a href="/facts/Christopher_Strachey/hx9ToYVY">Christopher Strachey</a>, co-designer of <a href="/facts/CPL_(programming_language)/WdCSdedV">CPL (programming language)</a>, father of <a href="/facts/Denotational_semantics/yRs3ygRA">Denotational semantics</a></li> <li><a href="/facts/Bjarne_Stroustrup/Be1Yq6rn">Bjarne Stroustrup</a>, the 2015 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for the design, implementation, and evolution of <a href="/facts/C%252B%252B/Et0F2qn9">C++</a> and <a href="/facts/IEEE_Computer_Society/asUJfKHp">IEEE Computer Society</a> 2018 Computer Pioneer Award</li> <li><a href="/facts/Gerald_Jay_Sussman/S18E8MNx">Gerald Jay Sussman</a>, co-designer of <a href="/facts/Scheme_(programming_language)/0aGdf3SC">Scheme</a></li> <li><a href="/facts/Bert_Sutherland/cPYP1s44">Bert Sutherland</a>, developed a two-dimensional <a href="/facts/Programming_language/cWTYbgWa">programming language</a> for manipulating graphical data,<a class="footnote-ref" id="fnref:65" href="#fn:65"><sup>65</sup></a> participated in the development of <a href="/facts/Smalltalk/Ru2UPVDE">Smalltalk</a> and <a href="/facts/Java_(programming_language)/9ScgFyAL">Java</a></li> <li><a href="/facts/Don_Syme/2xyvKfh1">Don Syme</a>, creator of <a href="/facts/F_Sharp_(programming_language)/jdXHnYz5">F#</a></li></ul> <h2 id="t">T</h2> <ul><li><a href="/facts/Tim_Teitelbaum/wnYD6Frs">Tim Teitelbaum</a>, co-developed the early (1978) <a href="/facts/Integrated_Development_Environment/jbEINSQf">IDE</a> <i>the Cornell Program Synthesizer</i>,<a class="footnote-ref" id="fnref:66" href="#fn:66"><sup>66</sup></a> co-founded <a href="/facts/GrammaTech/NEfUkpE7">GrammaTech</a>, which developed <a href="/facts/CodeSonar/DNwyMC8F">CodeSonar</a>, which performs <a href="/facts/Static_analysis/YkJEVPxs">static analysis</a> on <a href="/facts/C_(programming_language)/Ky2No763">C</a>, <a href="/facts/C%252B%252B/Et0F2qn9">C++</a>, <a href="/facts/C_Sharp_(programming_language)/UC2gxeyb">C#</a>, and <a href="/facts/Java_(programming_language)/9ScgFyAL">Java</a></li> <li><a href="/facts/Warren_Teitelman/vw6F5qLq">Warren Teitelman</a>, for <a href="/facts/BBN_LISP/LAdpCHrH">BBN LISP</a>, the 1992 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for the <a href="/facts/Integrated_development_environment/jbEINSQf">IDE</a> named <a href="/facts/Interlisp/zSEUS17z">Interlisp</a></li> <li><a href="/facts/Ken_Thompson/KQtrw9YM">Ken Thompson</a>, designer of <a href="/facts/B_(programming_language)/b9n2WoNN">B</a>, co-designer of <a href="/facts/Go_(programming_language)/oWlsmAFJ">Go</a>, <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> 1983</li> <li><a href="/facts/Simon_Thompson_(professor)/a5E7aSBe">Simon Thompson</a>, <a href="/facts/Functional_programming/cdxqPEIM">functional programming</a> research, textbooks; designs <a href="/facts/Cardano_(blockchain_platform)/0kYlFbI4">Cardano</a> <a href="/facts/Domain-specific_language/n18H1foD">domain-specific languages</a>: <a href="/facts/Cardano_(blockchain_platform)/0kYlFbI4">Marlowe</a></li> <li><a href="/facts/Mads_Tofte/HbtKIWCa">Mads Tofte</a>, co-author of the Definition of <a href="/facts/Standard_ML/4LaEq9tA">Standard ML</a>, <a href="/facts/Region_inference/58t5AIVL">region inference</a>, POPL 1994 Most Influential Paper Award<a class="footnote-ref" id="fnref:67" href="#fn:67"><sup>67</sup></a></li> <li><a href="/facts/Emina_Torlak/rBfqbLPU">Emina Torlak</a>, received the 2021 ACM <a href="/facts/SIGPLAN/BoQyp9jf">SIGPLAN</a> Robin Milner Young Researcher Award for leading work in automated verification<a class="footnote-ref" id="fnref:68" href="#fn:68"><sup>68</sup></a></li> <li><a href="/facts/Alan_Turing/klov9b6g">Alan Turing</a>, for the <a href="/facts/Turing_machine/ojCtglYu">Turing machine</a>; his work is so important that the <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a>, the "Nobel Prize of Computing," bears his name.</li> <li><a href="/facts/David_A._Turner/3mQuLpdo">David A. Turner</a>, designed and implemented <a href="/facts/SASL_(programming_language)/3TJjNTcT">SASL</a>, <a href="/facts/Kent_Recursive_Calculator/H7eXCENv">KRC</a>, and <a href="/facts/Miranda_(programming_language)/t9A6GFYv">Miranda</a>, member of <a href="/facts/IFIP_Working_Group_2.1/JhPYRM7c">IFIP Working Group 2.1</a> on Algorithmic Languages and Calculi</li></ul> <h2 id="u">U</h2> <ul><li><a href="/facts/Jeffrey_Ullman/7AqlHj4f">Jeffrey Ullman</a>, the 2020 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for fundamental algorithms and theory underlying programming language implementation and for synthesizing these results, highly influential books.</li> <li><a href="/facts/David_Ungar/k8jvPMN1">David Ungar</a>, the 2009 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a>, his work on <a href="/facts/Self_(programming_language)/sBp39553">Self</a> has had a profound effect on the field by introducing the advanced adaptive compiling technology that made the widespread industrial use of Java possible</li></ul> <h2 id="v">V</h2> <ul><li><a href="/facts/Martin_Vechev/2SCqxERT">Martin Vechev</a>, developed Silq, the first high-level PL for quantum computing with a strong static type system, the 2019 ACM <a href="/facts/SIGPLAN/BoQyp9jf">SIGPLAN</a> Robin Milner Young Researcher Award<a class="footnote-ref" id="fnref:69" href="#fn:69"><sup>69</sup></a></li> <li><a href="/facts/John_Vlissides/61wnw84b">John Vlissides</a>, one of the <a href="/facts/Design_Patterns/bHvkoxsu">Gang of Four</a>, the 2006 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a>, for ... their book <i><a href="/facts/Design_Patterns_(book)/sYDxSGc9">Design Patterns: ...</a></i>, ACM SIGPLAN 2005 PL Achievement Award<a class="footnote-ref" id="fnref:70" href="#fn:70"><sup>70</sup></a></li> <li><a href="/facts/Victor_A._Vyssotsky/Jya2NEeq">Victor A. Vyssotsky</a>, co-developed the pioneer dataflow language BLODI (BLOck DIagram). See <a href="/facts/Dataflow_programming/60IdWpE1">Dataflow programming</a></li></ul> <h2 id="w">W</h2> <ul><li><a href="/facts/Eiiti_Wada/Elt5cM2x">Eiiti Wada</a>, member of a team that designed <a href="/facts/ALGOL_N/UJuhLmBD">ALGOL N</a> as a proposed successor to <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a>, but it was not chosen for what became <a href="/facts/ALGOL_68/NTnc9fy7">ALGOL 68</a>; he later became a member of <a href="/facts/IFIP_Working_Group_2.1/JhPYRM7c">IFIP Working Group 2.1</a></li> <li><a href="/facts/Philip_Wadler/ShX91nId">Philip Wadler</a>, co-designer of <a href="/facts/Haskell/ydEsHuGy">Haskell</a>, involved in adding <a href="/facts/Generic_programming/kqtqJk7p">generic</a> types to <a href="/facts/Java_(programming_language)/9ScgFyAL">Java 5.0</a>, POPL 1993 Most Influential Paper Award<a class="footnote-ref" id="fnref:71" href="#fn:71"><sup>71</sup></a></li> <li><a href="/facts/Larry_Wall/gF8DqA5h">Larry Wall</a>, designer of <a href="/facts/Perl/fx31kjlT">Perl</a></li> <li><a href="/facts/Mitchell_Wand/6pKeqdx7">Mitchell Wand</a> works on <a href="/facts/Semantics/1L4WwLAP">semantics</a> of <a href="/facts/Programming_language/cWTYbgWa">programming languages</a>, co-author of <a href="/facts/Essentials_of_Programming_Languages/rhBg4uQY">Essentials of Programming Languages</a></li> <li><a href="/facts/John_Warnock/u6DY0Ssv">John Warnock</a>, the 1989 <a href="/facts/ACM_Software_System_Award/6JhQolwH">ACM Software System Award</a> for <a href="/facts/PostScript/4EeEtnLv">PostScript</a></li> <li><a href="/facts/David_H._D._Warren/LvqtYcuT">David Warren</a>, wrote the first compiler for <a href="/facts/Prolog/r5h66Qh1">Prolog</a>, designed the <a href="/facts/Warren_Abstract_Machine/BaP9a6tD">Warren Abstract Machine</a> (WAM), the <i>de facto</i> standard target for Prolog compilers</li> <li><a href="/facts/Mark_Wegman/YSedJyb9">Mark Wegman</a>, co-invented the <a href="/facts/Static_single-assignment_form/HnDHfx6I">static single-assignment form</a>, the ACM SIGPLAN 2006 PL Achievement Award<a class="footnote-ref" id="fnref:72" href="#fn:72"><sup>72</sup></a></li> <li><a href="/facts/Peter_Wegner_(computer_scientist)/XYjwa29v">Peter Wegner</a>, seminal work with <a href="/facts/Luca_Cardelli/bQjxEQhA">Cardelli</a> in OO programming: <i>On Understanding Types</i><a class="footnote-ref" id="fnref:73" href="#fn:73"><sup>73</sup></a></li> <li><a href="/facts/Peter_J._Weinberger/Gd45juyQ">Peter J. Weinberger</a>, contributed to the <a href="/facts/AWK_programming_language/lAQ0leyj">AWK programming language</a> and the Fortran compiler <a href="/facts/F77/m1KqjcMU">f77</a></li> <li><a href="/facts/Stephanie_Weirich/0dtpKean">Stephanie Weirich</a> work on type inference has been incorporated into the <a href="/facts/Glasgow_Haskell_Compiler/4msB3KFN">Glasgow Haskell Compiler</a>; the 2016 ACM <a href="/facts/SIGPLAN/BoQyp9jf">SIGPLAN</a> Robin Milner Young Researcher Award<a class="footnote-ref" id="fnref:74" href="#fn:74"><sup>74</sup></a></li> <li><a href="/facts/David_J._Wheeler/eMm8hmrz">David J. Wheeler</a>, the IEEE Computer Society 1985 <a href="/facts/Computer_Pioneer_Award/9PKCGf5W">Computer Pioneer Award</a> for <a href="/facts/Assembly_language/7XuV0cla">assembly language</a> programming</li> <li><a href="/facts/Jennifer_Widom/oDS0cHFz">Jennifer Widom</a>, for her PhD thesis on trace-based network proof systems<a class="footnote-ref" id="fnref:75" href="#fn:75"><sup>75</sup></a></li> <li><a href="/facts/Adriaan_van_Wijngaarden/vobXnR7n">Adriaan van Wijngaarden</a>, a designer of <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a> and <a href="/facts/ALGOL_68/NTnc9fy7">ALGOL 68</a>, developed the two-level <a href="/facts/Van_Wijngaarden_grammar/YkMRSh4u">Van Wijngaarden grammar</a>, expounded <a href="/facts/Continuation/53gyBXrB">continuations</a></li> <li><a href="/facts/Jeannette_Wing/PcAFFXXm">Jeannette Wing</a>, early work included <i>A behavioral notion of subtyping</i>,<a class="footnote-ref" id="fnref:76" href="#fn:76"><sup>76</sup></a> influential in the field as Corporate Vice President of <a href="/facts/Microsoft_Research/04A5LpMI">Microsoft Research</a> and later as <a href="/facts/Columbia_University/Hlf1gw53">Columbia University</a> executive vice president for research</li> <li><a href="/facts/Niklaus_Wirth/krsLUB11">Niklaus Wirth</a>, the 1984 <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> for developing a sequence of innovative computer languages, <a href="/facts/Euler_(programming_language)/13kHJTae">Euler</a>, <a href="/facts/ALGOL_W/xcgYM80d">ALGOL W</a>, <a href="/facts/Pascal_(programming_language)/b3yvp8bF">Pascal</a>, <a href="/facts/Modula/pxLbgVF5">Modula</a>, and <a href="/facts/Oberon_(programming_language)/YHFyy3UU">Oberon</a></li> <li><a href="/facts/Stephen_Wolfram/pJTChkGB">Stephen Wolfram</a>, creator of <a href="/facts/Mathematica/dRwoGFG2">Mathematica</a> and <a href="/facts/Wolfram_Language/MDxl50Yq">Wolfram Language</a></li> <li><a href="/facts/Mike_Woodger/TGkVzuqk">Mike Woodger</a>, influential in the design of software and languages, including <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a> and <a href="/facts/Ada_(programming_language)/Y2yHel4l">Ada</a><a class="footnote-ref" id="fnref:77" href="#fn:77"><sup>77</sup></a></li> <li><a href="/facts/Philip_Woodward/rcV3q71J">Philip Woodward</a>, designed <a href="/facts/CORAL/j7fBLrpw">CORAL</a> 66; his computer team developed the first implementation of <a href="/facts/ALGOL_68/NTnc9fy7">ALGOL 68</a>, <a href="/facts/ALGOL_68-R/9Ed1AtrD">ALGOL 68-R</a></li> <li><a href="/facts/William_Wulf/25eh9Btm">William Wulf</a>, co-designer of <a href="/facts/BLISS/5rYFKqDT">BLISS</a>, wrote an <a href="/facts/The_Design_of_an_Optimizing_Compiler/YxI8YyWH">optimizing compiler</a> for it, co-founded the compiler technology company <a href="/facts/Tartan%2c_Inc./K3M9uvn0">Tartan, Inc.</a></li></ul> <h2 id="y">Y</h2> <ul><li><a href="/facts/Katherine_Yelick/8G5T1p16">Katherine Yelick</a>, known for her work in <a href="/facts/Partitioned_global_address_space/wE3AwgJL">partitioned global address space</a> languages, including co-inventing <a href="/facts/Unified_Parallel_C/PxDHtBcP">Unified Parallel C</a></li> <li><a href="/facts/Andrey_Yershov/z2B4LyoI">Andrey Yershov</a>, theory, design, and implementation of programming languages (ALPHA, BETA, <a href="/facts/Rapira/6vJlKtRT">Rapira</a>),<a class="footnote-ref" id="fnref:78" href="#fn:78"><sup>78</sup></a> <a href="/facts/Partial_evaluation/cSBKhRPo">partial evaluation</a></li> <li><a href="/facts/Nobuo_Yoneda/P8YgbF3B">Nobuo Yoneda</a>, member of a team that designed <a href="/facts/ALGOL_N/UJuhLmBD">ALGOL N</a> as a proposed successor to <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a>, but it was not chosen for what became <a href="/facts/ALGOL_68/NTnc9fy7">ALGOL 68</a>; a member of <a href="/facts/IFIP_Working_Group_2.1/JhPYRM7c">IFIP Working Group 2.1</a></li> <li><a href="/facts/Akinori_Yonezawa/DaveC8yb">Akinori Yonezawa</a>, the 2008 AITO <a href="/facts/Dahl%25E2%2580%2593Nygaard_Prize/vtvbLxlE">Dahl–Nygaard Prize</a> for "his overall contribution to both theory and practice of concurrent OO languages...", designer <a href="/facts/Actor-Based_Concurrent_Language/eJzt1bw3">ABCL/R</a>, a <a href="/facts/Reflective_programming/Nj8stFfp">reflective</a> subset of the first <a href="/facts/Concurrent_computing/yVzQBPr9">concurrent</a> OO programming language ABCL/1</li></ul> <h2 id="z">Z</h2> <ul><li><a href="/facts/Marvin_Zelkowitz/wBIwgQrb">Marvin Zelkowitz</a>, PL features to aid in program development and debugging, tests for runtime correctness of executable code<a class="footnote-ref" id="fnref:79" href="#fn:79"><sup>79</sup></a><a class="footnote-ref" id="fnref:80" href="#fn:80"><sup>80</sup></a></li> <li><a href="/facts/Heinz_Zemanek/nAx4DdaV">Heinz Zemanek</a>, managed the <a href="/facts/IBM_Laboratory_Vienna/mWlgrs3c">IBM Laboratory Vienna</a>, was crucial in its developing a formal definition of <a href="/facts/PL%2fI/469mVYgd">PL/I</a></li> <li><a href="/facts/Jaap_A._Zonneveld/bHgE7hQJ">Jaap A. Zonneveld</a>, he and <a href="/facts/Edsger_W._Dijkstra/910x0MjT">Edsger W. Dijkstra</a> wrote the first <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a> compiler</li></ul> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Programming_language/cWTYbgWa">Programming language</a></li> <li><a href="/facts/List_of_computer_scientists/zd2xpuxp">List of computer scientists</a></li> <li><a href="/facts/List_of_programmers/MKLyNJKH">List of programmers</a></li></ul> <h2 id="external-links">External links</h2> <ul><li><a href="https://www.cs.cmu.edu/~mleone/language-people.html">Language People</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Arden, B.; Graham, R. (1959). "On GAT and the construction of translators". Communications of the ACM. 2 (7): 24. doi:10.1145/368370.368373. S2CID 6703069. <a href="/wiki/Bruce_Arden" target="_blank">/wiki/Bruce_Arden</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Bal, Henri E.; Kaashoek, M. Frans; Tanenbaum, Andrew S. (1992). "Orca: A language for parallel programming of distributed systems". IEEE Transactions on Software Engineering. 18 (3). IEEE: 190–205. doi:10.1109/32.126768. S2CID 1513191. <a href="/wiki/Henri_Bal" target="_blank">/wiki/Henri_Bal</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Samelson, Klaus; Bauer, Friedrich Ludwig (February 1960). "Sequential Formula Translation". Communications of the ACM. 3 (2): 76–83. doi:10.1145/366959.366968. S2CID 16646147. <a href="/wiki/Klaus_Samelson" target="_blank">/wiki/Klaus_Samelson</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>"AITO Dahl–Nygaard Prize Winners". Association Internationale pour les Technologies Objets. 2014. Retrieved 2022-08-21. <a href="https://www.aito.org/aito-dahl-nygaard/statutes-of-dahl-nygaard" target="_blank">https://www.aito.org/aito-dahl-nygaard/statutes-of-dahl-nygaard</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>"AITO Dahl–Nygaard Prize Winners". Association Internationale pour les Technologies Objets. 2014. Retrieved 2022-08-21. <a href="https://www.aito.org/aito-dahl-nygaard/statutes-of-dahl-nygaard" target="_blank">https://www.aito.org/aito-dahl-nygaard/statutes-of-dahl-nygaard</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>"ACM-AAAI Allen Newell Award". ACM. Retrieved 2022-09-07. <a href="https://awards.acm.org/newell" target="_blank">https://awards.acm.org/newell</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>"Jeremy Gibbons: publications". University of Oxford. Retrieved 2022-09-05. <a href="https://www.cs.ox.ac.uk/softeng/Jeremy.Gibbons/publications.html" target="_blank">https://www.cs.ox.ac.uk/softeng/Jeremy.Gibbons/publications.html</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>Arden, B.; Graham, R. (1959). "On GAT and the construction of translators". Communications of the ACM. 2 (7): 24. doi:10.1145/368370.368373. S2CID 6703069. <a href="/wiki/Bruce_Arden" target="_blank">/wiki/Bruce_Arden</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>"NAE members directory". NAE. 1993. Retrieved 2022-08-20. <a href="https://www.nae.edu/20412/MemberDirectory?qps=05&q=for%20contributions%20to%20the%20theory%20and%20practice%20of%20compiler%20construction" target="_blank">https://www.nae.edu/20412/MemberDirectory?qps=05&q=for%20contributions%20to%20the%20theory%20and%20practice%20of%20compiler%20construction</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>Gries, David (1971). Compiler Construction for Digital Computers (in English, Spanish, Japanese, Chinese, Italian, and Russian). New York: John Wiley and Sons. ISBN 0-471-32776-X. The first text on compiler writing. <a href="0-471-32776-X" target="_blank">0-471-32776-X</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>"IBM Punch cards on which the book was written are in the Stanford Museum". Retrieved 11 July 2022. <a href="http://infolab.stanford.edu/pub/voy/museum/pictures/display/floor5.htm" target="_blank">http://infolab.stanford.edu/pub/voy/museum/pictures/display/floor5.htm</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Gries, David; Levin, Gary (October 1980). "Assignment and procedure call proof rules". ACM Transactions on Programming Languages and Systems. 2 (4): 564–579. doi:10.1145/357114.357119. S2CID 2639439. <a href="/wiki/David_Gries" target="_blank">/wiki/David_Gries</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>The Design and Implementation of Programming Languages (PDF), University of Oxford, July 1983, retrieved September 7, 2022 <a href="https://www.cs.ox.ac.uk/files/3309/PRG40.pdf" target="_blank">https://www.cs.ox.ac.uk/files/3309/PRG40.pdf</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>Jones, C.B. (June 1981). Development Methods for Computer Programs including a Notion of Interference (PDF) (DPhil thesis). Oxford University. <a href="http://www.cs.ox.ac.uk/files/9025/PRG-25.pdf" target="_blank">http://www.cs.ox.ac.uk/files/9025/PRG-25.pdf</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>Gilles Kahn and David MacQueen (1976). Coroutines and Networks of Parallel Processes (Report). INRIA. <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> <li id="fn:32"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></p></li> <li id="fn:33"><p>Kenneth C. Knowlton (1966), "A programmer's description of L6", CACM, 9 (8): 616–625, doi:10.1145/365758.365792, S2CID 43669187 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></p></li> <li id="fn:34"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></p></li> <li id="fn:35"><p>"Robin Milner Young Researcher Award". SIGPLAN. 2021. Retrieved 2022-08-23. <a href="https://www.sigplan.org/Awards/Milner/" target="_blank">https://www.sigplan.org/Awards/Milner/</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></p></li> <li id="fn:36"><p>Bruce Leasure (2011). "Parafrase". In Padua, D. (ed.). Encyclopedia of Parallel Computing. Springer, Boston, MA. pp. 1407–1409. doi:10.1007/978-0-387-09766-4_434. ISBN 978-0-387-09765-7. <a href="978-0-387-09765-7" target="_blank">978-0-387-09765-7</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></p></li> <li id="fn:37"><p>PLDI is short for Programming Language Design and Implementation <a href="/wiki/Programming_Language_Design_and_Implementation" target="_blank">/wiki/Programming_Language_Design_and_Implementation</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></p></li> <li id="fn:38"><p>"Most Influential PLDI Paper Award". SIGPLAN. Retrieved 2022-08-21. <a href="https://www.sigplan.org/Awards/PLDI/" target="_blank">https://www.sigplan.org/Awards/PLDI/</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></p></li> <li id="fn:39"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></p></li> <li id="fn:40"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></p></li> <li id="fn:41"><p>Lindsey, C. H. (1996). "A History of ALGOL 68". In Bergin, T. J.; Gibson, R. G. (eds.). History of Programming Languages-II. ACM Press. ISBN 0-201-89502-1. <a href="0-201-89502-1" target="_blank">0-201-89502-1</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></p></li> <li id="fn:42"><p>Liu, Yanhong Annie (January 1996). Incremental Computation: A Semantics-Based Systematic Transformational Approach (PhD thesis). Cornell University. hdl:1813/7208. Retrieved 2022-09-08. <a href="https://hdl.handle.net/1813/7208" target="_blank">https://hdl.handle.net/1813/7208</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></p></li> <li id="fn:43"><p>Yanhong Annie Liu (2013). Systematic Program Design: From Clarity to Efficiency. Cambridge University Press. ISBN 978-1-107-61079-8. <a href="978-1-107-61079-8" target="_blank">978-1-107-61079-8</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></p></li> <li id="fn:44"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></p></li> <li id="fn:45"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></p></li> <li id="fn:46"><p>"Most Influential POPL Paper Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/POPL/" target="_blank">https://www.sigplan.org/Awards/POPL/</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></p></li> <li id="fn:47"><p>Natural Programming project, archived from the original on 2022-10-25, retrieved 2022-11-11 <a href="https://web.archive.org/web/20221025224806/https://www.cs.cmu.edu/~NatProg/index.html" target="_blank">https://web.archive.org/web/20221025224806/https://www.cs.cmu.edu/~NatProg/index.html</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></p></li> <li id="fn:48"><p>"Most Influential POPL Paper Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/POPL/" target="_blank">https://www.sigplan.org/Awards/POPL/</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></p></li> <li id="fn:49"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></p></li> <li id="fn:50"><p>"Most Influential POPL Paper Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/POPL/" target="_blank">https://www.sigplan.org/Awards/POPL/</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></p></li> <li id="fn:51"><p>Owicki, Susan; Lamport, Leslie (July 1982). "Proving liveness properties of concurrent programs". ACM Transactions on Programming Languages and Systems. 9 (3): 455–495. doi:10.1145/357172.357178. S2CID 17838416. <a href="/wiki/Susan_Owicki" target="_blank">/wiki/Susan_Owicki</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></p></li> <li id="fn:52"><p>"Programming Languages Software Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/Software/" target="_blank">https://www.sigplan.org/Awards/Software/</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></p></li> <li id="fn:53"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></p></li> <li id="fn:54"><p>Brian Randell; Lawford John Russell (1964). Algol 60 Implementation (PDF). Academic Press. ISBN 0-12-578150-4. {{cite book}}: ISBN / Date incompatibility (help) <a href="0-12-578150-4" target="_blank">0-12-578150-4</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></p></li> <li id="fn:55"><p>"The Proteus System for the Development of Parallel Applications". Kestrel Institute. 1994. Retrieved 2022-08-23. <a href="https://www.kestrel.edu/people/goldberg/papers/proteus-abstract/" target="_blank">https://www.kestrel.edu/people/goldberg/papers/proteus-abstract/</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></p></li> <li id="fn:56"><p>Teitelbaum, T.; T. Reps (September 1981). "The Cornell Program Synthesizer: A syntax-directed programming environment". Communications of the ACM. 24 (9): 563–573. doi:10.1145/358746.358755. S2CID 14317073. <a href="https://doi.org/10.1145%2F358746.358755" target="_blank">https://doi.org/10.1145%2F358746.358755</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></p></li> <li id="fn:57"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></p></li> <li id="fn:58"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></p></li> <li id="fn:59"><p>O.C., Chesley; Ren, X.; Ryder, Barbara G. (26 September 2005). Crisp: a debugging tool for Java programs. 21st IEEE International Conference on Software Maintenance (ICSM'05). IEEE. pp. 712–734. doi:10.1109/ICSM.2005.37. Retrieved 2022-08-23. <a href="/wiki/Barbara_G._Ryder" target="_blank">/wiki/Barbara_G._Ryder</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></p></li> <li id="fn:60"><p>Wei, Shiyi; Ryder, Barbara G. (2015). Boyland, John Tang (ed.). Adaptive context-sensitive analysis for JavaScript. 29th European Conference on Object-Oriented Programming (ECOOP 2015). Vol. 37. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. pp. 712–734. Retrieved 2022-08-23. <a href="/wiki/Barbara_G._Ryder" target="_blank">/wiki/Barbara_G._Ryder</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></p></li> <li id="fn:61"><p>Samelson, Klaus; Bauer, Friedrich Ludwig (February 1960). "Sequential Formula Translation". Communications of the ACM. 3 (2): 76–83. doi:10.1145/366959.366968. S2CID 16646147. <a href="/wiki/Klaus_Samelson" target="_blank">/wiki/Klaus_Samelson</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></p></li> <li id="fn:62"><p>Schneider, Fred B. (September 1997). On concurrent programming. Texts in Computer Science. Springer Verlag, Berlin, Heidelberg. p. 473. doi:10.1007/978-1-4612-1830-2. ISBN 978-0-387-94942-0. S2CID 9980317. <a href="978-0-387-94942-0" target="_blank">978-0-387-94942-0</a> <a href="#fnref:62" class="footnote-back-ref">↩</a></p></li> <li id="fn:63"><p>Sergey, Ilya; Nagaraj, Vaivaswatha; Johannsen, Jacob; Kumar, Amrit; Trunov, Anton; Hao, Ken Chan Guan (October 2019). Stephen N. Freund; Eran Yahav (eds.). "Safer smart contract programming with Scilla". Proceedings of the ACM on Programming Languages. 3 (OOPSLA). ACM: 1–30. doi:10.1145/3360611. S2CID 203577198. <a href="https://doi.org/10.1145%2F3360611" target="_blank">https://doi.org/10.1145%2F3360611</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></p></li> <li id="fn:64"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:64" class="footnote-back-ref">↩</a></p></li> <li id="fn:65"><p>Sutherland, William Robert (January 1966). The on-line graphical specification of computer procedures (PhD thesis). MIT. hdl:1721.1/13474. Retrieved 2022-08-25. <a href="/wiki/Bert_Sutherland" target="_blank">/wiki/Bert_Sutherland</a> <a href="#fnref:65" class="footnote-back-ref">↩</a></p></li> <li id="fn:66"><p>Teitelbaum, T.; T. Reps (September 1981). "The Cornell Program Synthesizer: A syntax-directed programming environment". Communications of the ACM. 24 (9): 563–573. doi:10.1145/358746.358755. S2CID 14317073. <a href="https://doi.org/10.1145%2F358746.358755" target="_blank">https://doi.org/10.1145%2F358746.358755</a> <a href="#fnref:66" class="footnote-back-ref">↩</a></p></li> <li id="fn:67"><p>"Most Influential POPL Paper Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/POPL/" target="_blank">https://www.sigplan.org/Awards/POPL/</a> <a href="#fnref:67" class="footnote-back-ref">↩</a></p></li> <li id="fn:68"><p>"Robin Milner Young Researcher Award". SIGPLAN. 2021. Retrieved 2022-08-23. <a href="https://www.sigplan.org/Awards/Milner/" target="_blank">https://www.sigplan.org/Awards/Milner/</a> <a href="#fnref:68" class="footnote-back-ref">↩</a></p></li> <li id="fn:69"><p>"Robin Milner Young Researcher Award". SIGPLAN. 2021. Retrieved 2022-08-23. <a href="https://www.sigplan.org/Awards/Milner/" target="_blank">https://www.sigplan.org/Awards/Milner/</a> <a href="#fnref:69" class="footnote-back-ref">↩</a></p></li> <li id="fn:70"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:70" class="footnote-back-ref">↩</a></p></li> <li id="fn:71"><p>"Most Influential POPL Paper Award". ACM SIGPLAN. Retrieved 2022-08-29. <a href="https://www.sigplan.org/Awards/POPL/" target="_blank">https://www.sigplan.org/Awards/POPL/</a> <a href="#fnref:71" class="footnote-back-ref">↩</a></p></li> <li id="fn:72"><p>"Programming Languages AchievementAward". Sigplan.org. Retrieved 2022-08-30. <a href="https://www.sigplan.org/Awards/Achievement/" target="_blank">https://www.sigplan.org/Awards/Achievement/</a> <a href="#fnref:72" class="footnote-back-ref">↩</a></p></li> <li id="fn:73"><p>Cardelli, Luca; Wegner, Peter (December 1985). "On understanding types, data abstraction, and polymorphism" (PDF). ACM Computing Surveys. 17 (4): 471–523. CiteSeerX 10.1.1.117.695. doi:10.1145/6041.6042. ISSN 0360-0300. S2CID 2921816. <a href="/wiki/Luca_Cardelli" target="_blank">/wiki/Luca_Cardelli</a> <a href="#fnref:73" class="footnote-back-ref">↩</a></p></li> <li id="fn:74"><p>"Robin Milner Young Researcher Award". SIGPLAN. 2021. Retrieved 2022-08-23. <a href="https://www.sigplan.org/Awards/Milner/" target="_blank">https://www.sigplan.org/Awards/Milner/</a> <a href="#fnref:74" class="footnote-back-ref">↩</a></p></li> <li id="fn:75"><p>Widom, Jennifer (1987). Trace-based network proof systems: expressiveness and completeness (concurrency) (PhD thesis). Cornell University. Retrieved 21 August 2022. <a href="/wiki/Jennifer_Widom" target="_blank">/wiki/Jennifer_Widom</a> <a href="#fnref:75" class="footnote-back-ref">↩</a></p></li> <li id="fn:76"><p>Liskov, Barbara H.; Wing, Jeannette (November 1994). "A behavioral notion of subtyping". ACM Transactions on Programming Languages and Systems. 16 (6): 1811–1841. doi:10.1145/197320.197383. S2CID 999172. <a href="/wiki/Barbara_Liskov" target="_blank">/wiki/Barbara_Liskov</a> <a href="#fnref:76" class="footnote-back-ref">↩</a></p></li> <li id="fn:77"><p>Yates, David (Spring 2010). "Pioneer Profile: Michael Woodger". Computer Resurrection – the Bulletin of the Computer Conservation Society. Vol. 50. <a href="http://www.computerconservationsociety.org/resurrection/res50.htm#d" target="_blank">http://www.computerconservationsociety.org/resurrection/res50.htm#d</a> <a href="#fnref:77" class="footnote-back-ref">↩</a></p></li> <li id="fn:78"><p>"Andrei Petrovich Ershov" (PDF). IEEE Computer Society. <a href="https://history.computer.org/pioneers/pdfs/E/Ershov.pdf" target="_blank">https://history.computer.org/pioneers/pdfs/E/Ershov.pdf</a> <a href="#fnref:78" class="footnote-back-ref">↩</a></p></li> <li id="fn:79"><p>— (September 1973). "Reversible execution". CACM. 16 (9): 566. doi:10.1145/362342.362360. S2CID 24277687. <a href="https://doi.org/10.1145%2F362342.362360" target="_blank">https://doi.org/10.1145%2F362342.362360</a> <a href="#fnref:79" class="footnote-back-ref">↩</a></p></li> <li id="fn:80"><p>— (January 1981). "Implementation of language enhancements". Computer Languages. 6 (3–4): 139–153. doi:10.1016/0096-0551(81)90026-6. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:80" class="footnote-back-ref">↩</a></p></li> </ol>