Justin Raymond
Vice President at PDT Partners
New York, New York, United States
Summary
🤩
Rockstar🎓
Top SchoolJustin Raymond is a Vice President and experienced software engineer with 12 years building production systems in finance and media, currently based in New York and leading engineering efforts at PDT Partners. He progressed from software engineer roles at Bloomberg to technical and leadership positions at PDT, combining hands-on development with team leadership and QA discipline. His open-source work spans Haskell and Rust ecosystems—improving critical documentation in the widely used haskell/vector library and hardening graph isomorphism tests in petgraph—demonstrating attention to correctness and developer experience. He brings full-stack fluency from early web and mobile projects to rigorous backend algorithm work, and he pairs a Wesleyan M.S. in Computer Science with practical teaching and mentoring experience. Unusually for a VP, he remains hands-on in code and tests, often focusing on the subtle documentation and testing improvements that reduce developer mistakes and production incidents.
12 years of coding experience
9 years of employment as a software developer
Master’s Degree Computer Science, Master’s Degree Computer Science at Wesleyan University
Stackoverflow
3,528reputation
144kreached
23answers
23questions
Github Skills (15)
testing10
data-structures10
graph-algorithms10
rust10
haskell10
documentation10
data-structure10
vector6
sml6
apache-spark6
iterator6
mapreduce6
ocaml6
scala6
smlnj6
Programming languages (6)
Github contributions (5)
petgraph/petgraph
Apr 2018 - Nov 2018
Graph data structure library for Rust.
Role in this project:
Back-end Developer & QA Engineer
Back-end Developer & QA EngineerContributions:1 review, 6 commits, 3 PRs in 7 months
Contributions summary:Justin contributed significantly to the `petgraph` library by implementing and refactoring graph isomorphism tests. Their work involved creating and modifying tests to verify graph isomorphism algorithms, including an iterative version for performance. The commits showcase their ability to work with graph data structures and algorithms, with a focus on testing and ensuring the correctness of core functionalities within the library.
data-structure-librarygraph-datarustgraphdata-structure
haskell/vector
Oct 2015 - Oct 2015
An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework .
Role in this project:Technical Writer
Technical WriterContributions:5 commits, 1 PR in 1 day
Contributions summary:Justin's contributions focused entirely on updating documentation within the `haskell/vector` repository. Specifically, they modified the documentation for the `unsafeNew` function across multiple modules within the project's structure, including Storable, Primitive, Unboxed, and Generic vector implementations. Their changes centered around improving the clarity and accuracy of the existing documentation. This work aimed at improving the user experience by providing clearer explanations for critical functions within the `vector` library.
intindexedarraysloopmutable
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.