Skip to main content
SpringerLink
Log in
Birkhäuser
Book cover

Categorical Combinators, Sequential Algorithms, and Functional Programming

  • Book
  • © 1993

Overview

Authors:
  1. Pierre-Louis Curien

    1. Département de Mathématiques et Informatique de l’École Normale Supérieure, CNRS-LIENS, Paris Cedex 05, France

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Progress in Theoretical Computer Science (PTCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Pages i-xx
    Download chapter PDF

  2. Categorical Combinators

    • Pierre-Louis Curien
    Pages 1-158

  3. Sequential Algorithms

    • Pierre-Louis Curien
    Pages 159-250

  4. CDS0: The Kernel of a Functional Language

    • Pierre-Louis Curien
    Pages 251-315

  5. The Full Abstraction Problem

    • Pierre-Louis Curien
    Pages 316-364

  6. Conclusion

    • Pierre-Louis Curien
    Pages 365-365

  7. Mathematical Prerequisites

    • Pierre-Louis Curien
    Pages 366-380

  8. Back Matter

    Pages 381-404
    Download chapter PDF
Back to top

Keywords

About this book

This book is a revised edition of the monograph which appeared under the same title in the series Research Notes in Theoretical Computer Science, Pit­ man, in 1986. In addition to a general effort to improve typography, English, and presentation, the main novelty of this second edition is the integration of some new material. Part of it is mine (mostly jointly with coauthors). Here is brief guide to these additions. I have augmented the account of categorical combinatory logic with a description of the confluence properties of rewriting systems of categor­ ical combinators (Hardin, Yokouchi), and of the newly developed cal­ culi of explicit substitutions (Abadi, Cardelli, Curien, Hardin, Levy, and Rios), which are similar in spirit to the categorical combinatory logic, but are closer to the syntax of A-calculus (Section 1.2). The study of the full abstraction problem for PCF and extensions of it has been enriched with a new full abstraction result: the model of sequential algorithms is fully abstract with respect to an extension of PCF with a control operator (Cartwright, Felleisen, Curien). An order­ extensional model of error-sensitive sequential algorithms is also fully abstract for a corresponding extension of PCF with a control operator and errors (Sections 2.6 and 4.1). I suggest that sequential algorithms lend themselves to a decomposition of the function spaces that leads to models of linear logic (Lamarche, Curien), and that connects sequentiality with games (Joyal, Blass, Abramsky) (Sections 2.1 and 2.6).

Authors and Affiliations

  • Département de Mathématiques et Informatique de l’École Normale Supérieure, CNRS-LIENS, Paris Cedex 05, France

    Pierre-Louis Curien

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation