Author : Jean Louis Krivine
Publisher : Prentice Hall
Page : 200 pages
File Size : 28,21 MB
Release : 1993
Category : Mathematics
ISBN :
This introduction to lambda-calculus looks at aspects of the theory: combinatory logic, models, and type streams, showing how they interlink and underpin computer science.
Author : Henk Barendregt
Publisher : Cambridge University Press
Page : 969 pages
File Size : 21,68 MB
Release : 2013-06-20
Category : 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.
Author : J. Roger Hindley
Publisher : Cambridge University Press
Page : 358 pages
File Size : 40,4 MB
Release : 2008-07-24
Category : Computers
ISBN : 9780521898850
Combinatory logic and lambda-calculus, originally devised in the 1920's, 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 long-awaited new version is thoroughly revised and offers a fully up-to-date 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.
Author : Roberto M. Amadio
Publisher : Cambridge University Press
Page : 504 pages
File Size : 15,53 MB
Release : 1998-07-02
Category : Computers
ISBN : 0521622778
Graduate text on mathematical foundations of programming languages, and operational and denotational semantics.
Author : Peter Selinger
Publisher :
Page : 108 pages
File Size : 14,8 MB
Release : 2018-10-04
Category : Science
ISBN : 9780359158850
This is a set of lecture notes that developed out of courses on the lambda calculus that the author taught at the University of Ottawa in 2001 and at Dalhousie University in 2007 and 2013. Topics covered in these notes include the untyped lambda calculus, the Church-Rosser theorem, combinatory algebras, the simply-typed lambda calculus, the Curry-Howard isomorphism, weak and strong normalization, polymorphism, type inference, denotational semantics, complete partial orders, and the language PCF.
Author : H.P. Barendregt
Publisher : North Holland
Page : 648 pages
File Size : 27,42 MB
Release : 1984
Category : Mathematics
ISBN :
The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications are given of those parts of the book which can be used to form a coherent course.
Author : Greg Michaelson
Publisher : Courier Corporation
Page : 338 pages
File Size : 30,82 MB
Release : 2013-04-10
Category : 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.
Author : Matthias Felleisen
Publisher : MIT Press
Page : 515 pages
File Size : 19,49 MB
Release : 2009-07-10
Category : Computers
ISBN : 0262062755
The first comprehensive presentation of reduction semantics in one volume, and the first tool set for such forms of semantics. This text is the first comprehensive presentation of reduction semantics in one volume; it also introduces the first reliable and easy-to-use tool set for such forms of semantics. Software engineers have long known that automatic tool support is critical for rapid prototyping and modeling, and this book is addressed to the working semantics engineer (graduate student or professional language designer). The book comes with a prototyping tool suite to develop, explore, test, debug, and publish semantic models of programming languages. With PLT Redex, semanticists can formulate models as grammars and reduction models on their computers with the ease of paper and pencil. The text first presents a framework for the formulation of language models, focusing on equational calculi and abstract machines, then introduces PLT Redex, a suite of software tools for expressing these models as PLT Redex models. Finally, experts describe a range of models formulated in Redex. PLT Redex comes with the PLT Scheme implementation, available free at http://www.plt-scheme.org/. Readers can download the software and experiment with Redex as they work their way through the book.
Author : Hendrik Pieter Barendregt
Publisher : Cambridge University Press
Page : 856 pages
File Size : 40,32 MB
Release : 2013-06-20
Category : Mathematics
ISBN : 0521766141
This handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.
Author : Alessandra Di Pierro
Publisher : Springer Nature
Page : 300 pages
File Size : 15,29 MB
Release : 2020-02-14
Category : Mathematics
ISBN : 3030411036
This Festschrift is in honor of Chris Hankin, Professor at the Imperial College in London, UK, on the Occasion of His 65th Birthday. Chris Hankin is a Fellow of the Institute for Security Science and Technology and a Professor of Computing Science. His research is in cyber security, data analytics and semantics-based program analysis. He leads multidisciplinary projects focused on developing advanced visual analytics and providing better decision support to defend against cyber attacks. This Festschrift is a collection of scientific contributions related to the topics that have marked the research career of Professor Chris Hankin. The contributions have been written to honour Chris' career and on the occasion of his retirement.
