Read Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)

Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)

Pierre-Louis Curien

4.9/5 (16888 ratings)

Description: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).We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science). To get started finding Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science), you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Pages: —

Format: PDF, EPUB & Kindle Edition

Publisher: —

Release: —

ISBN: 1461267048

Description: 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).We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science). To get started finding Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science), you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Special Offer | $0.00

Special Offer! | $0.00

Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)

Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)

More Books

Categorical Combinators, Sequential Algorithms, And Functional Programming

Categorical Combinators, Sequential Algorithms, And Functional Programming

Typed Lambda Calculi and Applications

Typed Lambda Calculi and Applications

Typed Lambda Calculi and Applications: 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009, Proceedings (Lecture Notes in Computer Science Book 5608)

Typed Lambda Calculi and Applications: 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009, Proceedings (Lecture Notes in Computer Science Book 5608)

Interactive Models of Computation and Program Behavior (Panoramas Et Syntheses)

Interactive Models of Computation and Program Behavior (Panoramas Et Syntheses)

Typed Lambda Calculi and Applications: 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009, Proceedings (Lecture Notes in Computer Science, 5608)

Typed Lambda Calculi and Applications: 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009, Proceedings (Lecture Notes in Computer Science, 5608)

Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science, Series Number 46)

Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science, Series Number 46)

Combinators and functional programming languages: Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985, proceedings (Lecture notes in computer science)

Combinators and functional programming languages: Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985, proceedings (Lecture notes in computer science)

Combinators and Functional Programming Languages: Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings (Lecture Notes in Computer Science, 242)

Combinators and Functional Programming Languages: Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings (Lecture Notes in Computer Science, 242)

Category Theory and Computer Science: Paris, France, September 3-6, 1991. Proceedings

Category Theory and Computer Science: Paris, France, September 3-6, 1991. Proceedings