Cantitate/Preț
Produs
Total produse
Vezi coșul
Higher-Order Algebra, Logic, and Term Rewriting: Second International Workshop, HOA '95, Paderborn, Germany, September 1995. Selected Papers de Gilles Dowek

Higher-Order Algebra, Logic, and Term Rewriting: Second International Workshop, HOA '95, Paderborn, Germany, September 1995. Selected Papers: Lecture Notes in Computer Science, cartea 1074

Editat de Gilles Dowek, Jan Heering, Karl Meinke, Bernhard Möller
en Limba Engleză Paperback – 8 mai 1996
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32006 lei

Preț vechi: 40007 lei
-20%

Puncte Express: 480

Carte tipărită la comandă

Livrare economică 20 iulie-03 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540612544
ISBN-10: 3540612548
Pagini: 304
Ilustrații: VIII, 296 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.43 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.