default search action
9th CTCS 2002: Ottawa, Canada
- Richard Blute, Peter Selinger:
Category Theory and Computer Science, CTCS 2002, Ottawa, Canada, August 15-17, 2002. Electronic Notes in Theoretical Computer Science 69, Elsevier 2002 - Samson Abramsky, Bob Coecke:
Physical Traces: Quantum vs. Classical Information Processing. 1-22 - Jirí Adámek, Stefan Milius, Jirí Velebil:
On Rational Monads and Free Iterative Theories. 23-46 - Stephen L. Bloom, Zoltán Ésik:
Unique, guarded fixed points in an additive setting: Extended Abstract. 47-61 - Pierre Boudes:
Non-Uniform Hypercoherences. 62-82 - Matteo Coccia, Fabio Gadducci, Ugo Montanari:
GS.Lambda Theories: A Syntax for Higher-Order Graphs. 83-100 - J. Robin B. Cockett, Luigi Santocanale:
Induction, Coinduction, and Adjoints. 101-119 - Esfandiar Haghverdi, Paulo Tabuada, George J. Pappas:
Bisimulation Relations for Dynamical and Control Systems. 120-136 - Masahito Hasegawa:
The Uniformity Principle on Traced Monoidal Categories. 137-155 - Jesse Hughes, Bart Jacobs:
Factorization systems and fibrations: Toward a fibred Birkhoff variety theorem. 156-182 - Jürgen Koslowski:
A monadic approach to polycategories. 183-208 - James Laird:
A Categorical Semantics of Higher Order Store. 209-226 - François Lamarche:
Multiplicative Linear Logics and Fibrations. 227-247 - Paul Blain Levy:
Adjunction Models For Call-By-Push-Value With Stacks. 248-271 - Maria Emilia Maietti:
Joyal's arithmetic universes via type theory. 272-286 - Stefan Milius:
On Iteratable Endofunctors. 287-304 - Lutz Schröder:
Classifying categories for partial equational logic. 305-322 - Paul Taylor:
Local Compactness and the Baire Category Theorem in Abstract Stone Duality. 323-345 - Krzysztof Worytkiewicz:
Paths and Simulations. 346-361 - Richard Blute, Peter Selinger:
Preface. 362-365
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.