Higher-Order Algebra, Logic, and Term Rewriting: Second International Workshop, Hoa '95, Paderborn, Germany, September 21-22, 1995: Selected Papers (Lecture Notes in Computer Science, 1074)

"This book presents a collection of revised refereed papers selected from the presentations accepted for the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting, HOA '95, held in Paderborn, Germany, in September 1995. The 14 research papers included, together with an invited paper by Jan Willem Klop, report state-of-the-art results; the relevant theoretical aspects are addressed, and in addition existing proof systems and term rewriting systems are discussed."--PUBLISHER'S WEBSITE Term graph rewriting....Pages 1-16 Approximation and normalization results for typeable term rewriting systems....Pages 17-36 Modular properties of algebraic type systems....Pages 37-56 Collapsing partial combinatory algebras....Pages 57-73 A complete proof system for Nested Term Graphs....Pages 74-89 R n - and G n -logics....Pages 90-108 The variable containment problem....Pages 109-123 Higher-order equational logic for specification, simulation and testing....Pages 124-143 The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving....Pages 144-162 Assertions and recursions....Pages 163-184 Development closed critical pairs....Pages 185-200 Two different strong normalization proofs?....Pages 201-220 Third-order matching in the polymorphic lambda calculus....Pages 221-237 Higher-order algebra with transfinite types....Pages 238-263 Abstraction of hardware construction....Pages 264-287

This book presents a collection of revised refereed papers selected from the presentations accepted for the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting, HOA '95, held in Paderborn, Germany, in September 1995.
The 14 research papers included, together with an invited paper by Jan Willem Klop, report state-of-the-art results; the relevant theoretical aspects are addressed, and in addition existing proof systems and term rewriting systems are discussed.

In this paper we will discuss in an informal way some aspects of term graph rewriting.