What people are saying - Write a review
We haven't found any reviews in the usual places.
H Comon and R Treinen
20 other sections not shown
Other editions - View all
A-term abstract algebra algorithm alphabet applied argument arity automata automaton binary call-by-name call-by-value called closure analysis cograph compact element Computer Science concurrency relations congruence relation consider constructor contains context-free grammar corresponding cotree decomposition defined Definition denote derivation domain DTWT edges equivalence classes equivalence relation example exists finite formula function graph G graph grammars graph language Hence i-calculus induction infinite interpretation Lecture Notes Lemma linear Logic Programming modular module nodes nonterminal notation Notes in Computer obtained operations partition Petri nets preorder prime subgraph problem projective Proof properties Proposition prove recursive redex reduction regular languages regular tree regular tree grammar replacement result rewriting systems Riordan array rule satisfies scheme second-order logic semantics step structure subset subterms supp(f symbols temporal logic Term Rewriting Systems Theorem theory top-context-free TopCf transformed transition tree grammar tree language underdiagonal walks variables vertex vertices w-regular