Cantitate/Preț
Produs

Category Theory and Computer Science: 6th International Conference, CTCS '95, Cambridge, United Kingdom, August 7 - 11, 1995. Proceedings: Lecture Notes in Computer Science, cartea 953

Editat de David Pitt, David E. Rydeheard, Peter Johnstone
en Limba Engleză Paperback – 21 iul 1995
This book presents the proceedings of the Sixth International Conference on Category Theory and Computer Science, CTCS '95, held in Cambridge, UK in August 1995.
The 15 revised full papers included in the volume document the exploitation of links between logic and category theory leading to a solid basis for much of the understanding of the semantics of computation. Notable amongst other advances is the introduction of linear logic and other substructural logics, providing a new approach to proof theory. Further aspects covered are semantics of lambda calculi and type theories, program specification and development, and domain theory.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 29335 lei

Preț vechi: 36669 lei
-20%

Puncte Express: 440

Preț estimativ în valută:
5620 6088$ 4820£

Carte tipărită la comandă

Livrare economică 06-13 mai

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540601647
ISBN-10: 3540601643
Pagini: 268
Ilustrații: IX, 259 p.
Dimensiuni: 155 x 233 x 14 mm
Greutate: 0.39 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Control structures: A model of interaction.- Convenient category of processes and simulations I: Modulo strong bisimilarity.- Dualities between nets and automata induced by schizophrenic objects.- Relational set theory.- Proof of a S.Mac Lane conjecture (extended abstract).- Effective applicative structures.- The S-replete construction.- The convex powerdomain in a category of posets realized by cpos.- Lifting as a KZ-doctrine.- Categorical fixed point calculus.- A category-theoretic treatment of a parallel algol-like language.- Categorical reconstruction of a reduction free normalization proof.- Decomposing typed lambda calculus into a couple of categorical programming languages.- V-comprehensions and P space.- A proposed categorical semantics for ML modules.