1 option
Category Theory and Computer Science : 7th International Conference, CTCS'97, Santa Margherita Ligure Italy, September 4-6, 1997, Proceedings / edited by Eugenio Moggi, Giuseppe Rosolini.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1290.
- Lecture Notes in Computer Science, 0302-9743 ; 1290
- Language:
- English
- Subjects (All):
- Computer architecture.
- Programming languages (Electronic computers).
- Computer logic.
- Logic, Symbolic and mathematical.
- 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.
- Local Subjects:
- Computer System Implementation.
- Programming Languages, Compilers, Interpreters.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- K-Theory.
- Mathematical Logic and Foundations.
- Physical Description:
- 1 online resource (IX, 319 pages).
- Edition:
- First edition 1997.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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).
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69552-3
- 9783540695523
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.