Buch, Englisch, Band 1290, 319 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1020 g
7th International Conference, CTCS'97, Santa Margherita Ligure Italy, September 4-6, 1997, Proceedings
Buch, Englisch, Band 1290, 319 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1020 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-63455-3
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Rechnerarchitektur
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Compiler
- Mathematik | Informatik Mathematik Algebra Algebraische Strukturen, Gruppentheorie
- Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
Weitere Infos & Material
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).
