|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Pierre LescannePublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 1987 ed. Volume: 256 Dimensions: Width: 15.50cm , Height: 1.50cm , Length: 23.50cm Weight: 0.920kg ISBN: 9783540172208ISBN 10: 3540172203 Pages: 288 Publication Date: 14 May 1987 Audience: General/trade , College/higher education , Professional and scholarly , General , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsTerm-rewriting implementation of equational logic programming.- Optimizing equational programs.- A compiler for conditional term rewriting systems.- How to choose the weights in the Knuth Bendix ordering.- Detecting looping simplifications.- Combinatorial hypermap rewriting.- The word problem for finitely presented monoids and finite canonical rewriting systems.- Term rewriting systems with priorities.- A gap between linear and non linear term-rewriting systems.- Code generator generation based on template-driven target term rewriting.- Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction.- Groups presented by certain classes of finite length-reducing string-rewriting systems.- Some results about confluence on a given congruence class.- Ground confluence.- Structured contextual rewriting.- Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes.- Completion for rewriting modulo a congruence.- On equational theories, unification and decidability.- A general complete E-unification procedure.- Improving basic narrowing techniques.- Strategy-controlled reduction and narrowing.- Algorithmic complexity of term rewriting systems.- Optimal speedups for parallel pattern matching in trees.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |