Biography:Phil Bagwell
From HandWiki
Short description: Computer scientist
Phil Bagwell (died 6 October 2012[1]) was a computer scientist known for his work and influence in the area of persistent data structures. He is best known for his 2000 invention of hash array mapped tries.[2]
Bagwell was probably the most influential researcher in the field of persistent data structures from 2000 until his death. His work is now a standard part of the runtimes of functional programming languages including Clojure, Scala, and Haskell.[3]
His contributions to building the Scala community are remembered in the Phil Bagwell Memorial Scala Community Award.[4]
Publications
- "Ideal Hash Trees" (2000), EPFL Technical Report
- "Fast Functional Lists, Hash-Lists, Deques and Variable Length Arrays" (2002), EPFL Technical Report
- "RRB Vector: A Practical General Purpose Immutable Sequence" (published posthumously in 2015) with Nicolas Stucki, Tiark Rompf, and Vlad Ureche, ICFP 2015
- "RRB-Trees: Efficient Immutable Vectors" (2012) with Tiark Rompf, EPFL Technical Report
References
- ↑ "R.I.P. Phil Bagwell | @lightbend" (in en). https://www.lightbend.com/blog/rip-phil-bagwell.
- ↑ Bagwell, Phil (2001). "Ideal Hash Trees" (in en). https://infoscience.epfl.ch/entities/publication/b892b2ce-7bf0-41d2-b68c-fb44a3c64a33.
- ↑ "Control.Concurrent.Map" (in en). https://hackage.haskell.org/package/ctrie-0.2/docs/Control-Concurrent-Map.html.
- ↑ "Phil Bagwell Memorial Scala Community Award" (in en). https://www.scala-lang.org/community/phil-bagwell-award.html.
 | This article needs additional or more specific categories. (April 2022) |
 |  |
