notes-computer-jasper-jasperNetMatching

need a way to express transitivity requirement

---

hmm... i think perhaps there is an even broader abstraction above graph patterns.. the idea of a 'pattern metalanguage' that can be used to extend a data language to produce patterns that can be matched .. graph patterns are one exampe (and perhaps a 'universal' example in the sense that maybe all of these other examples can be represented as graphs and graph patterns), but there are other more domain specific examples, such as regexs, database queries, type annotations (function signatures, esp. when you have derived the set of possible signatures that would 'fit' somewhere and need to represent that set), service interfaces/APIs.

in other words, Jasper should define a graph query language, but then users should be able to define e.g. a database query language, or a type system, or an API-definition language, by mapping these things onto graphs and then using the graph query language, thereby defining a DSL syntax that re-uses the syntactic primitives of the graph query language, making it easy for others to learn each of these DSLs.