Categorical Combinators, Sequential Algorithms, and Functional Programming

Name: Categorical Combinators, Sequential Algorithms, and Functional Programming
Brand: Springer, Basel
SKU: 9780817636548
Price: 553.98 RON
Availability: InStock

Autor: P.-L. Curien

Limbă:

Legare: Copertă tare

Editura: Springer, Basel

Disponibilitate: În depozitul extern

Expediem în 10-13 zile

553.98 lei

This book is a revised edition of the monograph which appeared under the same title in the series Re...

Informații despre carte

Autor

P.-L. Curien

Limbă

engleză

Legare

Carte - Copertă tare

Publicat

1993

Pagini

404

EAN

9780817636548

ISBN

0817636544

Enbook ID

01399011

Editura

Springer, Basel

Greutate

776

Dimensiuni

155 x 235 x 23

Descriere completă

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).

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Categorical Combinators, Sequential Algorithms, and Functional Programming

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Myths Of Northern Lands Narrated With Special Reference To Literature And Art

Pretty Little Liars #8: Wanted

Champions of Choice and Change

This Is Us

Everyday Applications of Psychological Science

S Ben Qayin; The Collected Writings

Top 100 US Retirement Plans - Single-Employer Pension Plans - Wisconsin: Employee Benefit Plans

Side Adventure

Beethoven: Selected Piano Pieces for Early Intermediate to Intermediate Level Players - Schirmer Library Volume 2149

Construction Management: From Project Concept to Completion

Guy Waterman

Oneida Verb Morphology: Yale University Publications In Anthropology, No. 48

Biotic and Abiotic Control of Aflatoxin B1 Synthesis

GLYPHOSATE, the Real Culprit behind Gluten Sensitivity

1st Fallschirmjager Division in World War II: VOLUME TWO: YEARS OF RETREAT

Introduction to Logic

Eunoia

Clienții care au cumpărat această carte au mai cumpărat și

ADAGIETTO ORCHESTRE-PARTITION+PARTIES SEPAREES

Die natürlichen Pflanzenfamilien nebst ihren Gattungen und wichtigeren Arten, insbesondere den Nutzpflanzen.

Even if you slit my Mouth 03

Okinawa.

Lavorare con Excel 2024. Guida all'uso