ISBN: 9780954300654 - an introduction to lambda calculi for computer scientists (texts in computing) (27 Ergebnisse)

Paperback. Zustand: Good. The lambda-calculus lies at the very foundations of computer science. Besides its historical role in computability theory it has had significant influence on programming language design and implementation, denotational semantics, and domain theory. The book emphasises the proof theory for the type-free lambda-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the lambda-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed lambda-calculus, then Milner-style polymorphism and, finally, the polymorphic lambda-calculus. Chapter 8 concerns two variants of the type-free lambda-calculus that have appeared in the research literature: the lazy lambda-calculus, and the lambda sigma-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout. In contrast to earlier books on these topics, which were written by logicians, this book is written from a computer science perspective and emphasises the practical relevance of many of the key theoretical ideas. The book is intended as a course text for final year undergraduates or first year graduate students in computer science. Research students should find it a useful introduction to more specialist literature.…

Paperback. Zustand: Good. The lambda-calculus lies at the very foundations of computer science. Besides its historical role in computability theory it has had significant influence on programming language design and implementation, denotational semantics, and domain theory. The book emphasises the proof theory for the type-free lambda-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the lambda-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed lambda-calculus, then Milner-style polymorphism and, finally, the polymorphic lambda-calculus. Chapter 8 concerns two variants of the type-free lambda-calculus that have appeared in the research literature: the lazy lambda-calculus, and the lambda sigma-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout. In contrast to earlier books on these topics, which were written by logicians, this book is written from a computer science perspective and emphasises the practical relevance of many of the key theoretical ideas. The book is intended as a course text for final year undergraduates or first year graduate students in computer science. Research students should find it a useful introduction to more specialist literature.…

Zustand: good. All pages and cover are intact. Dust jacket included if applicable, though it may be missing on hardcover editions. Spine and cover may show minor signs of wear including scuff marks, curls or bends to corners as well as cosmetic blemishes including stickers. Pages may contain limited notes or highlighting. "From the library of" labels may be present. Shrink wrap, dust covers, or boxed set packaging may be missing. Bundled media e.g., CDs, DVDs, access codes may not be included.…

Paperback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Zustand: New.

Paperback. Zustand: New.

Zustand: As New. Unread book in perfect condition.

Paperback or Softback. Zustand: New. An Introduction to Lambda Calculi for Computer Scientists. Book.

Paperback. Zustand: Very Good. An Introduction to Lambda Calculi for Computer Scientists This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping.…

Paperback. Zustand: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee.

Zustand: New.

Zustand: New. In English.

Zustand: Good. Volume 2. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,350grams, ISBN:9780954300654.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New. pp. 180.

Zustand: New. pp. 180 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Paperback. Zustand: New. In shrink wrap. Looks like an interesting title.

PF. Zustand: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Paperback. Zustand: New.

PAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Zustand: New. PRINT ON DEMAND pp. 180.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The lambda-calculus lies at the very foundations of computerscience. Besides its historical role in computability theory it hashad significant influence on programming language design andimplementation, denotational semantics, and domain theory. The bookemphasises the proof theory for the type-free lambda-calculus. Thefirst six chapters concern this calculus and cover the basic theory,reduction, models, computability, and the relationship between thelambda-calculus and combinatory logic. Chapter 7 presents a varietyof typed calculi; first the simply typed lambda-calculus, thenMilner-style polymorphism and, finally, the polymorphiclambda-calculus. Chapter 8 concerns two variants of the type-freelambda-calculus that have appeared in the research literature: thelazy lambda-calculus, and the lambda sigma-calculus. The finalchapter contains references and a guide to further reading. There areexercises throughout. In contrast to earlier books on these topics,which were written by logicians, this book is written from a computerscience perspective and emphasises the practical relevance of many ofthe key theoretical ideas. The book is intended as a course text forfinal year undergraduates or first year graduate students in computerscience. Research students should find it a useful introduction tomore specialist literature. …

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnThe lambda-calculus lies at the very foundations of computern science. Besides its historical role in computability theory it hasn had significant influence on programming language design andn imp.…

Taschenbuch. Zustand: Neu. An Introduction to Lambda Calculi for Computer Scientists | C. Hankin | Taschenbuch | Kartoniert / Broschiert | Englisch | 2004 | College Publications | EAN 9780954300654 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. …