Titlebook: Rewriting Techniques and Applications; 10th International C Paliath Narendran,Michael Rusinowitch Conference proceedings 1999 Springer-Verl

扔掉掐死你

美麗的寫(xiě)

Undecidability of the ,Part of the Theory of Ground Term Algebra Modulo an AC SymbolWe show that the .part of the equational theory modulo an AC symbol is undecidable. This solves the open problem 25 from the RTA list ([DJK91],[DJK93],[DJK95])

波動(dòng)

神圣將軍

悅耳

https://doi.org/10.1007/3-540-48685-2Automat; Constraint; Graph Rewriting; Higher Order Rewriting; Lex; String Rewriting; Term Rewriting; Theore

fibroblast

Normalisation in Weakly Orthogonal Rewriting(head-)normalising for almost orthogonal rewrite systems. We study (head-)normalisation for the larger class of weakly orthogonal rewrite systems. (Infinitary) normalisation is established and a counterexample against head-normalisation is given.

MOAT

易彎曲

A Characterisation of Multiply Recursive Functions with Higman’s Lemmaisation of the expressiveness of Higman’s lemma when applied to rewriting theory. The underlying argument of our construction is to connect the order type and the derivation length via the Hardy hierarchy.

易碎

Normalization via Rewrite Closures a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on congruence closure-based normalization methods. The description of known methods within our formalism also allows a better understanding of these procedures.

PANEL

978-3-540-66201-3Springer-Verlag Berlin Heidelberg 1999