Higher-Order Algebra, Logic, and Term Rewriting

TRAMA

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.

SOMMARIO

Term graph rewriting.- Approximation and normalization results for typeable term rewriting systems.- Modular properties of algebraic type systems.- Collapsing partial combinatory algebras.- A complete proof system for Nested Term Graphs.- R n - and G n -logics.- The variable containment problem.- Higher-order equational logic for specification, simulation and testing.- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving.- Assertions and recursions.- Development closed critical pairs.- Two different strong normalization proofs?.- Third-order matching in the polymorphic lambda calculus.- Higher-order algebra with transfinite types.- Abstraction of hardware construction.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9783540612544
• Collana: Lecture Notes in Computer Science
• Dimensioni: 235 x 155 mm
• Formato: Brossura
• Illustration Notes: VIII, 296 p.
• Pagine Arabe: 296
• Pagine Romane: viii