Cantitate/Preț
Produs

Category Theory and Computer Science: 7th International Conference, CTCS'97, Santa Margherita Ligure Italy, September 4-6, 1997, Proceedings: Lecture Notes in Computer Science, cartea 1290

Editat de Eugenio Moggi, Giuseppe Rosolini
en Limba Engleză Paperback – 20 aug 1997
This book constitutes the refereed proceedings of the 7th International Conference on Category Theory and Computer Science, CTCS'97, held in Santa Margheria Ligure, Italy, in September 1997.
Category theory attracts interest in the theoretical computer science community because of its ability to establish connections between different areas in computer science and mathematics and to provide a few generic principles for organizing mathematical theories. This book presents a selection of 15 revised full papers together with three invited contributions. The topics addressed include reasoning principles for types, rewriting, program semantics, and structuring of logical systems.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33388 lei

Preț vechi: 41734 lei
-20% Nou

Puncte Express: 501

Preț estimativ în valută:
6389 6630$ 5341£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540634553
ISBN-10: 354063455X
Pagini: 328
Ilustrații: IX, 319 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

An introduction to n-categories.- Allegories as a basis for algorithmics.- Separating shape from data.- A factorisation theorem in rewriting theory.- Monads and modular term rewriting.- A 2-categorical presentation of term graph rewriting.- Presheaf models for the ?-calculus.- Categorical modelling of structural operational rules case studies.- Specifying interaction categories.- Shedding new light in the world of logical systems.- Combining and representing logical systems.- A deciding algorithm for linear isomorphism of types with complexity O(nlog 2(n))..- Effectiveness of the global modulus of continuity on metric spaces.- Proof principles for datatypes with iterated recursion.- When Do Datatypes Commute?.- A calculus for collections and aggregates.- Lifting.- General synthetic domain theory — A logical approach (extended abstract).