Lambda-Calculus and Combinators (inbunden)
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
358
Utgivningsdatum
2008-07-01
Upplaga
2
Förlag
Cambridge University Press
Medarbetare
Seldin, Jonathan P.
Illustratör/Fotograf
10 b, w illus 1 table 55 exercises
Illustrationer
10 line diagrams 1 table 55 exercises 10 figures 50 worked examples
Dimensioner
234 x 153 x 221 mm
Vikt
620 g
Antal komponenter
1
Komponenter
9:B&W 6 x 9 in or 229 x 152 mm Case Laminate on Creme w/Gloss Lam
ISBN
9780521898850
Lambda-Calculus and Combinators (inbunden)

Lambda-Calculus and Combinators

An Introduction

Inbunden Engelska, 2008-07-01
589
Skickas inom 7-10 vardagar.
Fri frakt inom Sverige för privatpersoner.
Finns även som
Visa alla 1 format & utgåvor
Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.
Visa hela texten

Passar bra ihop

  1. Lambda-Calculus and Combinators
  2. +
  3. A Simple Lambda-Calculus Model of Programming Languages

De som köpt den här boken har ofta också köpt A Simple Lambda-Calculus Model of Programming L... av S Kamal Abdali (inbunden).

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

Kundrecensioner

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

Fler böcker av J Roger Hindley

  • Basic Simple Type Theory

    J Roger Hindley

    Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all...

  • Typed Lambda Calculi and Applications

    Philippe De Groote, J Roger Hindley

    This book constitutes the refereed proceedings of the Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, held in Nancy, France, in April 1997. The 24 revised full papers presented in the book were carefully selected...

Recensioner i media

From reviews of the first edition: 'The book of R. Hindley and J. Seldin is a very good introduction to fundamental techniques and results in these fields ... the book is clear, pleasant to read, and it needs no previous knowledge in the domain, but only basic notions of mathematical logic ... Clearly, it was impossible to treat everything in detail; but even when a subject is only skimmed, the book always provides an incentive for going deeper, and furnishes the means to do it, owing to a substantial bibliography. Several chapters end with interesting and useful notes with history, comments, and indications for further reading ... In conclusion, this book is very interesting and well written, and is highly recommended to everyone who wants to approach combinatory logic and lambda-calculus (logicians or computer scientists). J. Symbolic Logic

'The best general book on lambda-calculus (typed or untyped) and the theory of combinators.' Grard Huet, INRIA

'... for teaching and for research or self-study the book is an outstanding source with its own clear merits. I think this second edition of this classical book is a beautiful asset for the literature on -calculus and CL.' Theory and Practice of Logic Programming

'... well written and offers a broad coverage backed by an extensive list of references. It could serve as an excellent study material for classes on -calculus and CL as well as a reference for logicians and computer scientists interested in the formal background for functional programming and related areas.' EMS Newsletter

'Without doubt this is a valuable treatment of a venerable topic that rewards those who understand it. The authors successfully promulgate their tradition, and that is certainly more important than providing full proofs for every result.' The Journal of JFP

Bloggat om Lambda-Calculus and Combinators

Övrig information

J. Roger Hindley is an Honorary Research Fellow at Swansea University, Wales. His main research interests are Lambda-calculus and combinatory logic and he has taught at many international universities including Bristol University, Pennsylvania State University and Tokyo Institute of technology. This is his 7th book. Jonathan P. Seldin is a Professor in the Department of Mathematics and Computer Science at the University of Lethbridge in Alberta, Canada.

Innehållsförteckning

Preface; 1. The -calculus; 2. Combinatory logic; 3. The power of and CL; 4. Computable functions; 5. Undecidability; 6. Formal theories; 7. Extensionality in -calculus; 8. Extensionality in CL; 9. Correspondence between and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in ; 13. Generalizations of typing; 14. Models of CL; 15. Models of ; 16. Scott's D and other models; Appendix 1. -conversion; Appendix 2. Confluence proofs; Appendix 3. Normalization proofs; Appendix 4. Care of your pet combinator; Appendix 5. Answers to starred exercises; Bibliography; Index.