Higher-Order Algebra, Logic, and Term Rewriting (häftad)
Fler böcker inom
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
296
Utgivningsdatum
1996-05-01
Upplaga
1996 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Dowek, G. (ed.), Heering, J. (ed.), Meinke, K. (ed.)
Illustrationer
VIII, 296 p.
Dimensioner
234 x 156 x 16 mm
Vikt
427 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783540612544

Du kanske gillar

Higher-Order Algebra, Logic, and Term Rewriting (häftad)

Higher-Order Algebra, Logic, and Term Rewriting

Second International Workshop, HOA '95, Paderborn, Germany, September 1995. Selected Papers

av Gilles Dowek, Jan Heering, Karl Meinke, Bernhard Moeller
Häftad Engelska, 1996-05-01
699
Köp
Spara som favorit
  • Skickas inom 7-10 vardagar.
  • Gratis frakt inom Sverige över 199 kr för privatpersoner.
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.
Visa hela texten

Passar bra ihop

  1. Higher-Order Algebra, Logic, and Term Rewriting
  2. +
  3. Dopamine Nation

De som köpt den här boken har ofta också köpt Dopamine Nation av Dr Anna Lembke (häftad).

Köp båda 2 för 843 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

Gilles Dowek, Jan Heering, Karl Meinke, Bernhard Moeller

Innehållsförteckning

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.