The lambda calculus : its syntax and semantics

Bibliographic Information

The lambda calculus : its syntax and semantics

H.P. Barendregt

(Studies in logic and the foundations of mathematics, v. 103)

North-Holland , Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1984

Revised edition

Available at  / 4 libraries

Search this Book/Journal

Note

Bibliography: p. 585-598

Includes indexes

Description and Table of Contents

Description

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.

Table of Contents

Towards the Theory. Introduction. Conversion. Reduction. Theories. Models. Conversion. Classical Lambda Calculus. The Theory of Combinators. Classical Lambda Calculus (Continued). The Lambda-Calculus. Böhm Trees. Reduction. Fundamental Theorems. Strongly Equivalent Reductions. Reduction Strategies. Labelled Reduction. Other Notions of Reduction. Theories. Sensible Theories. Other Lambda Theories. Models. Construction of Models. Local Structure of Models. Global Structure of Models. Combinatory Groups. Appendices: Typed Lambda Calculus. Illative Combinatory Logic. Variables. References.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BA42895943
  • ISBN
    • 0444867481
  • LCCN
    80018587
  • Country Code
    ne
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Amsterdam ; New York,New York, N.Y.
  • Pages/Volumes
    xv, 621 p.
  • Size
    23 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top