Egison Pattern-Matching Engineering & Symbolic Computation

I write production and research code in the Egison language, a functional language whose signature feature is expressive non-linear pattern matching over non-free data types such as sets, multisets and graphs. If you have data whose structure resists ordinary matching, I model it as the right matcher and let the Egison language do the heavy lifting. My work covers three areas. First, pattern-matching design: I encode collections, permutations, poker hands, sequence alignments and combinatorial constraints as concise Egison matchers, then verify them against exhaustive test suites. Second, symbolic and mathematical computation: I use the built-in symbolic engine and tensor index notation to derive and differentiate expressions, prototype algorithms and check identities that would be tedious by hand. Third, research support: I help authors reproduce results from Egison papers, port prototypes, and translate mathematical specifications into runnable code. Deliverables include clean, commented source, a README, a runnable test harness and a short walkthrough call. I have several years of functional programming experience across Haskell and Scheme, which makes the transition into the Egison language natural for me. Tell me the shapes you need matched and the identities you want proved, and I will send a plan with milestones before I write a line of code.