About the service
I develop applied and research code in Egison language — a functional language whose key feature is expressive non-linear pattern matching over non-free data types: sets, multisets, graphs. If you have data whose structure doesn't fit standard pattern matching, I design a suitable matcher, and Egison language handles the heavy lifting. My practice splits into three directions. First — pattern design: I encode collections, permutations, poker combinations, sequence alignment and combinatorial constraints as concise matchers and verify them with exhaustive tests. Second — symbolic and mathematical computation: I apply the built-in symbolic engine and tensor index notation to derive and differentiate expressions, prototype algorithms and verify identities that are tedious to compute by hand. Third — research support: I help reproduce results from Egison language papers, port prototypes and turn mathematical specifications into executable code. The deliverable includes clean commented source, README, runnable test suite and a short call with walkthrough. I have years of functional programming experience with Haskell and Scheme, so the move to Egison comes naturally. Describe what structures you need to match and what identities to prove, and I'll send a plan with milestones before the first line of code.
