Advertisement

The Parametric Lambda Calculus

A Metamodel for Computation

  • Simona Ronchi Della Rocca
  • Luca Paolini

Part of the Texts in Theoretical Computer Science book series (TTCS)

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Syntax

    1. Front Matter
      Pages 1-1
    2. Simona Ronchi Della Rocca, Luca Paolini
      Pages 3-23
    3. Simona Ronchi Della Rocca, Luca Paolini
      Pages 25-33
    4. Simona Ronchi Della Rocca, Luca Paolini
      Pages 35-59
    5. Simona Ronchi Della Rocca, Luca Paolini
      Pages 61-61
  3. Operational Semantics

    1. Front Matter
      Pages 63-63
    2. Simona Ronchi Della Rocca, Luca Paolini
      Pages 65-72
    3. Simona Ronchi Della Rocca, Luca Paolini
      Pages 73-88
    4. Simona Ronchi Della Rocca, Luca Paolini
      Pages 89-94
    5. Simona Ronchi Della Rocca, Luca Paolini
      Pages 95-100
    6. Simona Ronchi Della Rocca, Luca Paolini
      Pages 101-101
  4. Denotational Semantics

    1. Front Matter
      Pages 103-103
    2. Simona Ronchi Della Rocca, Luca Paolini
      Pages 105-117
    3. Simona Ronchi Della Rocca, Luca Paolini
      Pages 119-179
    4. Simona Ronchi Della Rocca, Luca Paolini
      Pages 181-206
    5. Simona Ronchi Della Rocca, Luca Paolini
      Pages 207-219
    6. Simona Ronchi Della Rocca, Luca Paolini
      Pages 221-222
  5. Computational Power

    1. Front Matter
      Pages 223-223
    2. Simona Ronchi Della Rocca, Luca Paolini
      Pages 225-231
    3. Simona Ronchi Della Rocca, Luca Paolini
      Pages 233-240
  6. Back Matter
    Pages 241-254

About this book

Introduction

The parametric lambda calculus is a metamodel for reasoning about various kinds of computations. Its syntactic definition is based on the notion of "sets of input values", and different lambda calculi can be obtained from it by instantiating such sets in suitable ways.

The parametric lambda calculus is used as a tool for presenting in a uniform way basic notions of programming languages, and for studying with a uniform approach some lambda calculi modeling different kinds of computations, such as call-by-name, both in its lazy and non-lazy versions, and call-by-value. The parametric presentation allows us both to prove in one step all the fundamental properties of different calculi, and to compare them with each other.

The book includes some classical results in the field of lambda calculi, but completely rephrased using the parametric approach, together with some new results. The lambda calculi are presented from a computer science viewpoint, with particular emphasis on their semantics, both operational and denotational.

This book is dedicated to researchers, and can be used as a textbook for masters or Ph.D. courses on the foundations of computer science.

Keywords

Artificial Intelligence Computational Models Denotational Semantics Formal Languages Lambda Calculi Mathematical Logic Operational Semantics Programming Languages Syntax Theoretical Computer Science lambda calculus semantics

Authors and affiliations

  • Simona Ronchi Della Rocca
    • 1
  • Luca Paolini
    • 1
  1. 1.Dipartimento di InformaticaUniversità di TorinoTorinoItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-10394-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-05746-5
  • Online ISBN 978-3-662-10394-4
  • Series Print ISSN 1862-4499
  • Buy this book on publisher's site