Category Theory and Computer Science 7th International Conference, CTCS'97, Santa Margherita Ligure Italy, September 4-6, 1997, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Moggi, Eugenio (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Rosolini, Giuseppe (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
• Έκδοση: 1st ed. 1997.
• Σειρά: Lecture Notes in Computer Science, 1290
• Θέματα: Architecture, Computer.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; K-theory.; Computer System Implementation.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.; K-Theory.; Mathematical Logic and Foundations.

 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. 

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