A rewriting calculus for cyclic higher-order term graphs.
Paolo BaldanClara BertolissiHoratiu CirsteaClaude KirchnerPublished in: Math. Struct. Comput. Sci. (2007)
Keyphrases
- higher order
- rewriting rules
- graph model
- lambda calculus
- natural images
- high order
- directed graph
- bipartite graph
- graph theory
- pairwise
- rewrite rules
- low order
- weighted graph
- markov random field
- graph representation
- spanning tree
- undirected graph
- conditional random fields
- conjunctive queries
- datalog programs
- transformation rules
- query terms
- algebraic structure
- programming language