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.

*"synopsis" may belong to another edition of this title.*

US$ 15.75

**Shipping:**
FREE

From United Kingdom to U.S.A.

Published by
Kings College Publications, United Kingdom
(2004)

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **Kings College Publications, United Kingdom, 2004. Paperback. Condition: New. Language: English . Brand New Book ***** Print on Demand *****.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. Seller Inventory # AAV9780954300654

Published by
Kings College Publications, United Kingdom
(2004)

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **Kings College Publications, United Kingdom, 2004. Paperback. Condition: New. Language: English . Brand New Book ***** Print on Demand *****. 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. Seller Inventory # AAV9780954300654

Published by
Kings College Publications
(2004)

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Kings College Publications, 2004. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780954300654

Published by
College Publications
(2016)

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **College Publications, 2016. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Seller Inventory # ria9780954300654_lsuk

Published by
College Publications
(2004)

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Softcover
Quantity Available: 1

Seller:

Rating

**Book Description **College Publications, 2004. Condition: New. This item is printed on demand for shipment within 3 working days. Seller Inventory # GM9780954300654

Published by
Kings College Publications
(2004)

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Kings College Publications, 2004. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # LQ-9780954300654

Published by
College Publications 2/2/2004
(2004)

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Paperback or Softback
Quantity Available: 10

Seller:

Rating

**Book Description **College Publications 2/2/2004, 2004. Paperback or Softback. Condition: New. An Introduction to Lambda Calculi for Computer Scientists. Book. Seller Inventory # BBS-9780954300654

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Quantity Available: 5

Seller:

Rating

**Book Description **Condition: New. Seller Inventory # ria9780954300654_ing

Published by
Kings College Publications, United Kingdom
(2004)

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **Kings College Publications, United Kingdom, 2004. Paperback. Condition: New. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. 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. Seller Inventory # LIE9780954300654

Published by
College Publications
(2004)

ISBN 10: 0954300653
ISBN 13: 9780954300654

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **College Publications, 2004. Paperback. Condition: New. Seller Inventory # INGM9780954300654