regal furnace
I have a question concerning Ocaml pattern matching extension. More clearly, my task is to extend the existing syntactic pattern matching algorithm the Ocaml language use with other more general matching (equational matching). For example, if we have an ocaml program:
let foo x = match x with
exp1 -> exp1'
exp2 -> exp2'
...
we want to have a matching algorithm integrated in the language which solves exp1 << x not only syntactically also with modulo some theory.
Could you tell me please what library would be best to look? Any suggestions will be helpful.
limpid stratus