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.
"synopsis" may belong to another edition of this title.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want