Rewriting Techniques and Applications [[electronic resource] ] : 7th International Conference, RTA-96, New Brunswick, NJ, USA July 27 - 30, 1996. Proceedings / / edited by Harald Ganzinger

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996
• Edizione: 1st ed. 1996.
• Descrizione fisica: 1 online resource (XI, 440 p.)
• Disciplina: 005.13/1
• Soggetto topico: Software engineering; Computers; Programming languages (Electronic computers); Computer logic; Mathematical logic; Artificial intelligence; Software Engineering/Programming and Operating Systems; Theory of Computation; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Artificial Intelligence
• Persona (resp. second.): GanzingerHarald
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: Rewrite-based automated reasoning: Challenges ahead -- Fine-grained concurrent completion -- AC-complete unification and its application to theorem proving -- Superposition theorem proving for abelian groups represented as integer modules -- Symideal Gröbner bases -- Termination of constructor systems -- Dummy elimination in equational rewriting -- On proving termination by innermost termination -- A recursive path ordering for higher-order terms in ?-long ?-normal form -- Higher-order superposition for dependent types -- Higher-order narrowing with definitional trees -- Design of a proof assistant -- A compiler for nondeterministic term rewriting systems -- Combinatory reduction systems with explicit substitution that preserve strong normalisation -- Confluence properties of extensional and non-extensional ?-calculi with explicit substitutions (extended abstract) -- On the power of simple diagrams -- Coherence for sharing proof nets -- Modularity of termination in term graph rewriting -- Confluence of terminating conditional rewrite systems revisited -- Applications of rewrite techniques in monoids and rings -- Compositional term rewriting: An algebraic proof of Toyama's theorem -- The first-order theory of one-step rewriting is undecidable -- An algorithm for distributive unification -- On the termination problem for one-rule semi-Thue system -- Efficient second-order matching -- Linear second-order unification -- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type -- Decidable approximations of term rewriting systems -- Semantics and strong sequentially of priority term rewriting systems -- Higher-order families -- A new proof manager and graphic interface for the larch prover -- ReDuX 1.5: New facets of rewriting -- CiME: Completion modulo E -- Distributed larch prover (DLP): An experiment in parallelizing a rewrite-rule based prover -- EPIC: An equational language Abstract machine and supporting tools -- SPIKE-AC: A system for proofs by induction in Associative-Commutative theories -- On gaining efficiency in completion-based theorem proving.
• Sommario/riassunto: This book constitutes the refereed proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, held in New Brunswick, NJ, USA, in July 1996. The 27 revised full papers presented in this volume were selected from a total of 84 submissions, also included are six system descriptions and abstracts of three invited papers. The topics covered include analysis of term rewriting systems, string and graph rewriting, rewrite-based theorem proving, conditional term rewriting, higher-order rewriting, unification, symbolic and algebraic computation, and efficient implementation of rewriting on sequential and parallel machines.
• Titolo autorizzato: Rewriting Techniques and Applications
• ISBN: 3-540-68596-0
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465665203316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 1103