default search action
4th Category Theory and Computer Science 1991: Paris, France
- David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew M. Pitts, Axel Poigné, David E. Rydeheard:
Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings. Lecture Notes in Computer Science 530, Springer 1991, ISBN 3-540-54495-X - Thomas Ehrhard, Pasquale Malacaria:
Stone Duality for Stable Functions. 1-15 - Roberto M. Amadio:
Bifinite Domains: Stable Case. 16-33 - Robert D. Tennent:
Local Variables and Non-Interference in Algol-like Languages. 34-36 - Abbas Edalat, Michael B. Smyth:
Categories of Information Systems. 37-52 - Raymond Hoofman, Harold Schellinx:
Collapsing Graph Models by Preorders. 53-73 - Peter W. O'Hearn:
Linear Logic and Interference Control. 74-93 - Albert Burroni:
Higher Dimensional Word Problem. 94-105 - Sachio Hirokawa:
BCK-Formulas Having Unique Proofs. 106-120 - Richard Blute:
Proof Nets and Coherence Theorems. 121-137 - Eugenio Moggi:
A Modular Approach to Denotational Semantics. 138-139 - Grzegorz Jarzembski:
Programs in Partial Algebras - a Categorical Approach. 140-150 - C. Barry Jay:
Tail Recursion from Universal Invariants. 151-163 - Thierry Coquand:
A Direct Proof of the Intuitionistic Ramsey Theorem. 164-172 - Dusko Pavlovic:
Constructions and Predicates. 173-196 - Bart Jacobs, Eugenio Moggi, Thomas Streicher:
Relating Models of Impredicative Type Theories. 197-218 - Wesley Phoa:
Two Results on Set-Theoretic Polymorphism. 219-235 - Andrea Corradini, Ugo Montanari:
An Algebra of Graphs and Graph Rewriting. 236-260 - Eugene W. Stark:
Dataflow Networks are Fibrations. 261-281 - Pierpaolo Degano, Stefano Kasangian, Sebastiano Vigna:
Applications of the Calculus of Trees to Process Description Languages. 282-301
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.