An Introduction to Lambda Calculi for Computer Scientists
Title | An Introduction to Lambda Calculi for Computer Scientists PDF eBook |
Author | Chris Hankin |
Publisher | College Publications |
Total Pages | 164 |
Release | 2004 |
Genre | Computers |
ISBN | 9780954300654 |
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.
Lambda Calculi
Title | Lambda Calculi PDF eBook |
Author | Chris Hankin |
Publisher | |
Total Pages | 184 |
Release | 1994 |
Genre | Computers |
ISBN |
This is a textbook for final year undergraduates/first year graduates in computer science, as well as a useful introduction for research students seeking a solid introduction to more specialist literature. This text emphasises the role of calculus in programming language design and implementation, denotational semantics, and domain theory. Alternative books on the subject have been written by logicians, but this is the first to have been written from a computer science prespective, invaluable in emphasising the practical relevance of the key theortical ideas.
Lambda Calculi
Title | Lambda Calculi PDF eBook |
Author | Chris Hankin |
Publisher | |
Total Pages | 162 |
Release | 1994 |
Genre | Lambda calculus. |
ISBN | 9780198538417 |
Lambda calculus lies at the very foundation 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. This book is written from a systems perspective, emphasizing the practical relevance of many of the key theoretical ideas.
Domains and Lambda-Calculi
Title | Domains and Lambda-Calculi PDF eBook |
Author | Roberto M. Amadio |
Publisher | Cambridge University Press |
Total Pages | 504 |
Release | 1998-07-02 |
Genre | Computers |
ISBN | 0521622778 |
Graduate text on mathematical foundations of programming languages, and operational and denotational semantics.
Basic Category Theory for Computer Scientists
Title | Basic Category Theory for Computer Scientists PDF eBook |
Author | Benjamin C. Pierce |
Publisher | MIT Press |
Total Pages | 117 |
Release | 1991-08-07 |
Genre | Computers |
ISBN | 0262326450 |
Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Contents Tutorial • Applications • Further Reading
Lambda Calculus with Types
Title | Lambda Calculus with Types PDF eBook |
Author | Henk Barendregt |
Publisher | Cambridge University Press |
Total Pages | |
Release | 2013-06-20 |
Genre | Mathematics |
ISBN | 1107276349 |
This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.
An Introduction to Functional Programming Through Lambda Calculus
Title | An Introduction to Functional Programming Through Lambda Calculus PDF eBook |
Author | Greg Michaelson |
Publisher | Courier Corporation |
Total Pages | 336 |
Release | 2013-04-10 |
Genre | Mathematics |
ISBN | 0486280292 |
Well-respected text for computer science students provides an accessible introduction to functional programming. Cogent examples illuminate the central ideas, and numerous exercises offer reinforcement. Includes solutions. 1989 edition.