I am currently attempting to design a system involving:
- abstract pattern matching with:
- other magic
- state update accumulation
- composable update batches
- meta data
- priority management
These are the main features of a project idea I’ve had for a while, which has recently become rather more colourful.
I originally wanted to try to build a generic pattern matching system with a new type of regular expression for almost any data type: (lists, trees, graphs, …). Similar to clojure’s core.match.
Recently I’ve been having ideas about CSS: how terrible it is at it’s job, and how I would design a replacement.
It turns out that both of these projects have similar components and ideas have crossed between them; so much so that now the projects have merged into one!
This project touches on a few computing science areas that peek my interest: programming languages and semantics, logic programming, functional programming, and pattern matching.
I still have a lot to work out, but it should be interesting and fun :]