Jump to content

List of programming language researchers: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Mdmi (talk | contribs)
added "little languages" for Kernighan
Mdmi (talk | contribs)
add Martin Richards
Line 250: Line 250:
* [[Mitchel Resnick]], developed the [[Visual programming language|visual programming language]] called [[Scratch (programming language)|Scratch]]
* [[Mitchel Resnick]], developed the [[Visual programming language|visual programming language]] called [[Scratch (programming language)|Scratch]]
* [[John C. Reynolds]], invented [[polymorphic lambda calculus|polymorphic lambda calculus (System F)]], clarified early work on [[continuation]]s, introduced [[defunctionalization]], worked on a [[separation logic]] to describe and reason about shared mutable [[data structure]]s
* [[John C. Reynolds]], invented [[polymorphic lambda calculus|polymorphic lambda calculus (System F)]], clarified early work on [[continuation]]s, introduced [[defunctionalization]], worked on a [[separation logic]] to describe and reason about shared mutable [[data structure]]s
* [[Martin Richards (computer scientist) | Martin Richards]], designed and implemented [[BCPL]]
* [[Dennis Ritchie]], designer of [[C (programming language)|C]], [[Turing Award|1983 Turing Award]]
* [[Dennis Ritchie]], designer of [[C (programming language)|C]], [[Turing Award|1983 Turing Award]]
* [[Guido van Rossum]], designer of [[Python (programming language)|Python]]
* [[Guido van Rossum]], designer of [[Python (programming language)|Python]]

Revision as of 16:46, 24 August 2022

The following is list of researchers of programming language theory, design, implementation, and related areas.

A

  • Martín Abadi, for the programming language Baby Modula-3 and his book (with Luca Cardelli) A Theory of Objects
  • Samson Abramsky, contributions to the areas of the lazy lambda calculus and concurrency theory and co-editing the 6 Volume Handbook of Logic in Computer Science
  • Gul Agha, elected as an ACM Fellow in 2018 for research in concurrent programming and formal methods, specifically the Actor Model
  • Alfred Aho, 2020 Turing Award citation: for fundamental algorithms and theory underlying programming language implementation and for synthesizing these results ...highly influential books ...
  • Frances Allen, 2006 Turing Award citation: for pioneering contributions to the theory and practice of optimizing compiler techniques ...
  • Andrew Appel, especially well-known because of his compiler books, the Modern Compiler Implementation in ML (ISBN 0-521-58274-1) series, as well as Compiling With Continuations (ISBN 0-521-41695-7)
  • Bruce Arden, co-authored two compilers, GAT[1] for the IBM 650 and MAD

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

R

S

T

U

  • Jeffrey Ullman, 2020 Turing Award citation: for fundamental algorithms and theory underlying programming language implementation and for synthesizing these results ... highly influential books ...
  • David Ungar, the 2009 AITO Dahl-Nygaard Prize, his work on Self has had a profound effect on the field by introducing the advanced adaptive compilation technology that made the widespread industrial use of Java possible

V

W

Y


See also

References

  1. ^ 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.
  2. ^ a b 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.
  3. ^ a b "AITO Dahl-Nygaard Prize Winners". Association Internationale pour les Technologies Objets. 2014. Retrieved 2022-08-21.
  4. ^ "SIGPLAN Programming Languages Achievement Award — 2009: Rod Burstall". ACM SIGPLAN. Retrieved 21 August 2022.
  5. ^ 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.
  6. ^ "NAE members directory". NAE. 1993. Retrieved 2022-08-20.
  7. ^ 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.
  8. ^ "IBM Punch cards on which the book was written are in the Stanford Museum". Retrieved 11 July 2022.
  9. ^ Gries, David; Levin, Gary (October 1980). "Assignment and procedure call proof rules". TOPLAS. 2 (4): 564–579. doi:10.1145/357114.357119.
  10. ^ "Programming Languages AchievementAward". www.sigplan.org. Retrieved 2022-08-22.
  11. ^ PLDI is short for Programming Language Design and Implementation
  12. ^ "Most Influential PLDI Paper Award". ACM] SIGPLAN. Retrieved 2022-08-21.
  13. ^ "Orc Language".
  14. ^ Owicki, Susan; Lamport, Leslie (July 1982). "Proving liveness properties of concurrent programs". ACM Transactions on Programming Languages and Systems. 9: 455–495.
  15. ^ Brian Randell; Lawford John Russell (1964). Algol 60 Implementation (PDF). Academic Press. ISBN 0-12-578150-4.
  16. ^ "The Proteus System for the Development of Parallel Applications". Kestrel Institute. 1994. Retrieved 2022-08-23.
  17. ^ a b 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.
  18. ^ 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.
  19. ^ 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.
  20. ^ 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.
  21. ^ "Robin Milner Young Researcher Award". SIGPLAN. 2021. Retrieved 2022-08-23.
  22. ^ 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.
  23. ^ Widom, Jennifer (1987). Trace-based network proof systems: expressiveness and completeness (concurrency) (PhD thesis). Cornell University. Retrieved 21 August 2022.
  24. ^ Liskov, Barbara H.; Wing, Jeannette (November 1994). "A behavioral notion of subtyping". TOPLAS. 16 (6): 1811–1841. doi:10.1145/197320.197383.
  25. ^ Yates, David (Spring 2010). "Pioneer Profile: Michael Woodger". Computer Resurrection – The Bulletin of the Computer Conservation Society. Vol. 50.