About the service
I'm a functional programming engineer and work daily in Koka — a research language built around algebraic effects and row-based effect types. If you need a prototype, library or tool near the compiler where every side effect is tracked in the type signature, not hidden in the runtime, I'll help. My typical work looks like this: I describe your domain with a small set of effect operations, write handlers that give these operations concrete meaning, and let Koka's type checker prove that no unhandled effect escapes. Because of this, the same logic runs on a real database, a stub or deterministic replay for tests — just swap the handler. I've used this technique to build parsers, finite automata, async pipelines and interpreters for small domain languages. On the compiler side, I confidently read how Koka unfolds effects in evidence-passing style, reason about how typed compilation lowers handlers, and diagnose why an effect row doesn't unify the way you expected. As a result you get clean commented Koka source, a short project note justifying chosen effect signatures and a test suite checking each handler in isolation. Complex spots I describe separately so your team can maintain the code after me. If you see effect handlers as a replacement for monad transformers or callback spaghetti — send me the task and I'll propose a concrete effect design before we start.
