Tikhon Jelvis
where else to find them
what they talk about
all 6 in the filters
where they keep going back
- Scale By the Bay3 editions2018–2023
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Analyzing Programs with SMT Solvers | FUN OCaml 2025 | 2025-09-15 |
Uses Z3 with OCaml bindings and SMTML to compile a tiny IMP language into SMT formulas, generating Z3 with OCaml bindings expressions for literals, variables… | ||
| Better Code Design with Types and Concepts. | Scale By the Bay 2023 | 2023-11-13 |
Argues that static types work as a design tool not just bug catchers, using Haskell and Python examples to show types give fast feedback and shape concepts… | ||
| What is Functional Reactive Programming? | Scale By The Bay 2019 | 2019-11-13 |
Defines FRP as a time-focused, functional-style abstraction that represents continuous state as behaviors and discrete occurrences as events, with concrete… | ||
| Interview | Scale By The Bay 2019 | 2019-11-13 |
Work at Target's supply chain AI group uses Haskell (and past projects in Racket and OCaml) to build event-driven simulations and optimization services, and an… | ||
| Radix Trees: How IntMap Works | Scale By The Bay 2018 | 2018-11-15 |
Haskell's IntMap is a radix tree (Patricia trie) that stores integer keys bitwise with path compression so lookups cost key-length, not map-size; worst case… | ||
| Interview | Scale By The Bay 2018 | 2018-11-15 |
Lead data scientist at Target describes a production simulation platform that models real Target distribution centers and runs at warehouse scale, built with… | ||
| The Radix Trees How IntMap Works | Lambda World Seattle 2018 | 2018-09-17 |
Explains how IntMap implements a compressed binary trie with three constructors: Leaf(key,value), Branch(prefix,mask,left,right) and Empty, where lookups test… | ||
| nothing matches | ||