06406nam 22007455 450 99646610520331620200702134204.03-540-49223-210.1007/3-540-59200-8(CKB)1000000000234260(SSID)ssj0000326348(PQKBManifestationID)11213064(PQKBTitleCode)TC0000326348(PQKBWorkID)10296634(PQKB)10828340(DE-He213)978-3-540-49223-8(PPN)155178210(EXLCZ)99100000000023426020121227d1995 u| 0engurnn|008mamaatxtccrRewriting Techniques and Applications[electronic resource] 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5 - 7, 1995. Proceedings /edited by Jieh Hsiang1st ed. 1995.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1995.1 online resource (XII, 480 p.) Lecture Notes in Computer Science,0302-9743 ;914Bibliographic Level Mode of Issuance: Monograph3-540-59200-8 On some mathematical logic contributions to rewriting techniques: Lost heritage -- Modularity of completeness revisited -- Automatic termination proofs with transformation orderings -- A termination ordering for higher order rewrite systems -- A complete characterization of termination of 0p 1q?1r 0s -- On narrowing, refutation proofs and constraints -- Completion for multiple reduction orderings -- Towards an efficient construction of test sets for deciding ground reducibility -- Term rewriting in contemporary resolution theorem proving -- ??!?=1 Optimizing optimal ?-calculus implementations -- Substitution tree indexing -- Concurrent garbage collection for concurrent rewriting -- Lazy rewriting and eager machinery -- A rewrite mechanism for logic programs with negation -- Level-confluence of conditional rewrite systems with extra variables in right-hand sides -- A polynomial algorithm testing partial confluence of basic semi-Thue systems -- Problems in rewriting applied to categorical concepts by the example of a computational comonad -- Relating two categorical models of term rewriting -- Towards a domain theory for termination proofs -- Higher-order rewrite systems -- Infinitary lambda calculi and böhm models -- Proving the genericity lemma by leftmost reduction is simple -- (Head-)normalization of typeable rewrite systems -- Explicit substitutions with de bruijn's levels -- A restricted form of higher-order rewriting applied to an HDL semantics -- Rewrite systems for integer arithmetic -- General solution of systems of linear diophantine equations and inequations -- Combination of constraint solving techniques: An algebraic point of view -- Some independence results for equational unification -- Regular substitution sets: A means of controlling E-unification -- DISCOUNT: A system for distributed equational deduction -- ASTRE: Towards a fully automated program transformation system -- Parallel ReDuX ? PaReDuX -- STORM: A many-to-one associative-commutative matcher -- LEMMA: A system for automated synthesis of recursive programs in equational theories -- Generating polynomial orderings for termination proofs -- Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2 -- Prototyping completion with constraints using computational systems -- Guiding term reduction through a neural network: Some preliminary results for the group theory -- Studying quasigroup identities by rewriting techniques: Problems and first results -- Problems in rewriting III.This volume presents the proceedings of the Sixth International Conference on Rewriting Techniques and Applications, RTA-95, held in Kaiserslautern, Germany in April 1995. The 27 full revised papers were selected from a total of 87 submissions. In addition there are 9 system descriptions and two problem sets, one contributed by Mark E. Stickel and Hantao Zhang and another by Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop. The volume addresses all current aspects of rewriting techniques and their applications and thus defines the state-of-the-art in this active field of research.Lecture Notes in Computer Science,0302-9743 ;914Programming languages (Electronic computers)ComputersSoftware engineeringComputer logicMathematical logicComputer science—MathematicsProgramming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Symbolic and Algebraic Manipulationhttps://scigraph.springernature.com/ontologies/product-market-codes/I17052Programming languages (Electronic computers).Computers.Software engineering.Computer logic.Mathematical logic.Computer science—Mathematics.Programming Languages, Compilers, Interpreters.Theory of Computation.Software Engineering/Programming and Operating Systems.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.Symbolic and Algebraic Manipulation.005.13/1Hsiang Jiehedthttp://id.loc.gov/vocabulary/relators/edtInternational Conference on Rewriting Techniques and Applications(6th :1995 :Kaiserslautern, Germany)BOOK996466105203316Rewriting Techniques and Applications774195UNISA