MTU Cork Library Catalogue

Syndetics cover image
Image from Syndetics

Domains and lambda calculi / Roberto M. Amadio and Pierre-Louis Curien.

By: Amadio, Roberto M.
Contributor(s): Curien, P.-L. (Pierre-Louis).
Material type: materialTypeLabelBookSeries: Cambridge tracts in theoretical computer science ; 46.Publisher: Cambridge : Cambridge University Press, 1998Description: xvi, 484 p. ; 24 cm.ISBN: 0521622778 .Subject(s): Lambda calculus | CalculusDDC classification: 511.3
Contents:
Continuity and computability -- Syntactic theory of the calculus -- D models and intersection types -- Interpretation of calculi in CCC's -- CCC's of algebraic dcpo's -- The language of PCF -- Domain equations -- Values and computations -- Powerdomains -- Stone duality -- Dependent and second order types -- Stability -- Towards linear logic -- Sequentiality -- Domains and realizability -- Functions and processes.
Holdings
Item type Current library Call number Copy number Status Date due Barcode Item holds
General Lending MTU Bishopstown Library Lending 511.3 (Browse shelf(Opens below)) 1 Available 00076298
Total holds: 0

Enhanced descriptions from Syndetics:

This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modeling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is now known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.

Includes bibliographical references (pages 469-479) and index.

Continuity and computability -- Syntactic theory of the calculus -- D models and intersection types -- Interpretation of calculi in CCC's -- CCC's of algebraic dcpo's -- The language of PCF -- Domain equations -- Values and computations -- Powerdomains -- Stone duality -- Dependent and second order types -- Stability -- Towards linear logic -- Sequentiality -- Domains and realizability -- Functions and processes.

Table of contents provided by Syndetics

  • Preface
  • Notation
  • 1 Continuity and computability
  • 2 Syntactic theory of thl-calculus
  • 3 D models and intersection types
  • 4 Interpretation of l-calculi in CCC's
  • 5 CCC's of algebraic Dcpo's
  • 6 The language PCF
  • 7 Domain equations
  • 8 Values and computations
  • 9 Powerdomains
  • 10 Stone duality
  • 11 Dependent and second order types
  • 12 Stability
  • 13 Towards linear logic
  • 14 Sequentiality
  • 15 Domains and realizability
  • 16 Functions and processes
  • Appendix A Memento of recursion theory
  • Appendix B Memento of category theory
  • Bibliography
  • Index

Powered by Koha