| 12. 6. 2024 | Blog moving to new location – byorgey.wordpress.com
|
| 22. 8. 2023 | Swarm 0.4 release – byorgey.wordpress.com
|
| 13. 7. 2023 | Compiling to Intrinsically Typed Combinators – byorgey.wordpress.com
|
| 20. 6. 2023 | Competitive Programming in Haskell: two more DP challenges – byorgey.wordpress.com
|
| 17. 6. 2023 | Nested folds – byorgey.wordpress.com
|
| 6. 6. 2023 | Dynamic programming in Haskell: automatic memoization – byorgey.wordpress.com
|
| 2. 6. 2023 | Dynamic programming in Haskell: lazy immutable arrays – byorgey.wordpress.com
|
| 31. 5. 2023 | Competitive programming in Haskell: introduction to dynamic programming – byorgey.wordpress.com
|
| 24. 5. 2023 | Competitive programming in Haskell: parsing with an NFA – byorgey.wordpress.com
|
| 22. 5. 2023 | New ko-fi page: help me attend ICFP! – byorgey.wordpress.com
|
| 3. 5. 2023 | Competitive programming in Haskell: tries – byorgey.wordpress.com
|
| 11. 4. 2023 | Competitive programming in Haskell: topsort via laziness – byorgey.wordpress.com
|
| 11. 3. 2023 | Competitive programming in Haskell challenge: Letter Optimization – byorgey.wordpress.com
|
| 24. 2. 2023 | Competitive programming in Haskell: Infinite 2D array, Level 4 – byorgey.wordpress.com
|
| 7. 2. 2023 | Subtracting natural numbers: types and usability – byorgey.wordpress.com
|
| 16. 1. 2023 | Competitive programming in Haskell: Infinite 2D array, Levels 2 and 3 – byorgey.wordpress.com
|
| 2. 1. 2023 | Binary search over floating point representations – byorgey.wordpress.com
|
| 1. 1. 2023 | Competitive programming in Haskell: better binary search – byorgey.wordpress.com
|
| 12. 12. 2022 | Swarm virtual hackathon – byorgey.wordpress.com
|
| 3. 12. 2022 | Competitive programming in Haskell: Infinite 2D array, Level 1 – byorgey.wordpress.com
|
| 6. 10. 2022 | Swarm alpha release! – byorgey.wordpress.com
|
| 1. 9. 2022 | Competitive programming in Haskell: Infinite 2D array – byorgey.wordpress.com
|
| 27. 8. 2022 | Types for top-level definitions – byorgey.wordpress.com
|
| 20. 6. 2022 | Swarm: status report – byorgey.wordpress.com
|
| 17. 11. 2021 | Competitive programming in Haskell: BFS, part 4 (implementation via STUArray) – byorgey.wordpress.com
|
| 15. 11. 2021 | Competitive programming in Haskell: Enumeration – byorgey.wordpress.com
|
| 29. 10. 2021 | Competitive programming in Haskell: BFS, part 3 (implementation via HashMap) – byorgey.wordpress.com
|
| 18. 10. 2021 | Competitive programming in Haskell: BFS, part 2 (alternative APIs) – byorgey.wordpress.com
|
| 14. 10. 2021 | Competitive programming in Haskell: BFS, part 1 – byorgey.wordpress.com
|
| 1. 10. 2021 | Swarm: a lot can happen in a week – byorgey.wordpress.com
|
| 24. 9. 2021 | Swarm: preview and call for collaboration – byorgey.wordpress.com
|
| 22. 9. 2021 | Competitive programming in Haskell: Codeforces Educational Round 114 – byorgey.wordpress.com
|
| 17. 9. 2021 | Automatically updated, cached views with lens – byorgey.wordpress.com
|
| 9. 9. 2021 | Competitive programming in Haskell: Kadane’s algorithm – byorgey.wordpress.com
|
| 8. 9. 2021 | Implementing Hindley-Milner with the unification-fd library – byorgey.wordpress.com
|
| 11. 8. 2021 | Competitive programming in Haskell: monoidal accumulation – byorgey.wordpress.com
|
| 24. 6. 2021 | Types versus sets in math and programming languages – byorgey.wordpress.com
|
| 19. 6. 2021 | Competitive programming in Haskell: folding folds – byorgey.wordpress.com
|
| 8. 6. 2021 | Average and median via optimization – byorgey.wordpress.com
|
| 23. 2. 2021 | Competitive programming in Haskell: folding challenge – byorgey.wordpress.com
|
| 18. 7. 2020 | Competitive programming in Haskell: cycle decomposition with mutable arrays – byorgey.wordpress.com
|
| 11. 7. 2020 | Competitive programming in Haskell: 2D cross product, part 1 – byorgey.wordpress.com
|
| 29. 6. 2020 | Competitive programming in Haskell: data representation and optimization, with cake – byorgey.wordpress.com
|
| 24. 6. 2020 | Competitive programming in Haskell: vectors and 2D geometry – byorgey.wordpress.com
|
| 9. 6. 2020 | Anyone willing to help me get set up with something like miso? – byorgey.wordpress.com
|
| 30. 5. 2020 | Competitive programming in Haskell: permutations – byorgey.wordpress.com
|
| 23. 5. 2020 | Competitive programming in Haskell: building unordered trees – byorgey.wordpress.com
|
| 19. 5. 2020 | Competitive programming in Haskell: sorting tree shapes – byorgey.wordpress.com
|
| 16. 5. 2020 | Competitive programming in Haskell: summer series – byorgey.wordpress.com
|
| 7. 4. 2020 | Data structure challenge: application – byorgey.wordpress.com
|
| 6. 4. 2020 | Data structure challenge: solutions – byorgey.wordpress.com
|
| 23. 3. 2020 | Data structure challenge: finding the rightmost empty slot – byorgey.wordpress.com
|
| 3. 3. 2020 | Competitive Programming in Haskell: modular arithmetic, part 2 – byorgey.wordpress.com
|
| 23. 2. 2020 | What would Dijkstra do? Proving the associativity of min – byorgey.wordpress.com
|
| 15. 2. 2020 | Competitive Programming in Haskell: modular arithmetic, part 1 – byorgey.wordpress.com
|
| 11. 2. 2020 | Unexpected benefits of version control – byorgey.wordpress.com
|
| 7. 2. 2020 | Competitive Programming in Haskell: primes and factoring – byorgey.wordpress.com
|
| 18. 12. 2019 | Counting inversions via rank queries – byorgey.wordpress.com
|
| 20. 11. 2019 | Computing Eulerian paths is harder than you think – byorgey.wordpress.com
|
| 13. 10. 2019 | Competitive Programming in Haskell: reading large inputs with ByteString – byorgey.wordpress.com
|
| 5. 7. 2019 | Lightweight invertible enumerations in Haskell – byorgey.wordpress.com
|
| 22. 5. 2019 | Competitive Programming in Haskell: Scanner – byorgey.wordpress.com
|
| 14. 5. 2019 | Lightweight, efficiently sampleable enumerations in Haskell – byorgey.wordpress.com
|
| 30. 4. 2019 | Code style and moral absolutes – byorgey.wordpress.com
|
| 24. 4. 2019 | Competitive Programming in Haskell: Basic Setup – byorgey.wordpress.com
|
| 14. 3. 2019 | Idea for a physics-based rolling ball puzzle game – byorgey.wordpress.com
|
| 24. 2. 2019 | What’s the right way to QuickCheck floating-point routines? – byorgey.wordpress.com
|
| 16. 2. 2019 | Worstsort – byorgey.wordpress.com
|
| 13. 2. 2019 | Finding roots of polynomials in Haskell? – byorgey.wordpress.com
|
| 4. 11. 2018 | Hendrix teams at ACM ICPC – byorgey.wordpress.com
|
| 20. 10. 2018 | What’s the Difference? video and slides – byorgey.wordpress.com
|
| 6. 10. 2018 | Counting inversions with monoidal sparks – byorgey.wordpress.com
|
| 1. 10. 2018 | Monoidal sparks – byorgey.wordpress.com
|
| 23. 6. 2018 | New ICFP functional pearl on subtracting bijections – byorgey.wordpress.com
|
| 22. 5. 2018 | Ertugrul Söylemez: 1985-2018 – byorgey.wordpress.com |