Category Theory and Computer Science
Editat de David Pitt, David E. Rydeheard, Peter Johnstoneen Limba Engleză Paperback – 21 iul 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.
Preț: 319.52 lei
Preț vechi: 399.41 lei
-20% Nou
Puncte Express: 479
Preț estimativ în valută:
56.54€ • 65.94$ • 49.64£
56.54€ • 65.94$ • 49.64£
Carte tipărită la comandă
Livrare economică 15-29 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540601647
ISBN-10: 3540601643
Pagini: 268
Ilustrații: IX, 259 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540601643
Pagini: 268
Ilustrații: IX, 259 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.