About the service
I am a functional-logic programmer and work professionally in Curry, so I offer to design and implement declarative solutions where ordinary imperative code turns into confusion. Curry combines pure functions in the Haskell spirit with logic programming: I describe a task as a set of relations, and narrowing and nondeterministic computation themselves traverse the search space. It's my daily tool. Over the years I've written constraint solvers, puzzle and schedule engines, syntax analyzers, and small domain languages, always preferring readable equations to manual loop optimization. The typical workflow is: we agree on a specification, I model the domain with algebraic types and function patterns, add free variables and nondeterministic choice where search is needed, and encapsulate the result so calling code gets deterministic, testable answers. The main systems are PAKCS and KiCS2; I know how to spot where search explodes and add constraints in advance to cut it down. Deliverables include commented source code, a short note on the declarative model, a test suite, and a call to walk through the design so your team can maintain the code. I also help academic projects: reference implementations for papers, teaching examples, reproducible artifacts for evaluation. If you have a combinatorial or rule-based task and need a clear solution, not a black box, Curry is ideal, and I'm happy to build it with you.
