Higher-Order Algebra, Logic, and Term Rewriting: Second International Workshop, HOA '95, Paderborn, Germany, September 1995. Selected Papers - Couverture souple
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
