default search action
2nd Category Theory and Computer Science 1987: Edinburgh, UK
- David H. Pitt, Axel Poigné, David E. Rydeheard:
Category Theory and Computer Science, Edinburgh, UK, September 7-9, 1987, Proceedings. Lecture Notes in Computer Science 283, Springer 1987, ISBN 3-540-18508-9 - Giuseppe Rosolini:
Categories and Effective Computations. 1-11 - Andrew M. Pitts:
Polymorphism is Set Theoretic, Constructively. 12-39 - Thierry Coquand, Thomas Ehrhard:
An Equational Presentation of Higher Order Logic. 40-56 - Stefano Kasangian, Anna Labella, Alberto Pettorossi:
Enriched Categories for Local and Interaction Calculi. 57-70 - David B. Benson:
The Category of Milner Processes is Exact. 71-97 - Glynn Winskel:
Relating Two Models of Hardware. 98-113 - David E. Rydeheard, John G. Stell:
Foundations of Equational Deduction: A Categorical Treatment of Equational Proofs and Unification Algorithms. 114-139 - Tatsuya Hagino:
A Typed Lambda Calculus with Categorical Type Constructors. 140-157 - Lawrence S. Moss, José Meseguer, Joseph A. Goguen:
Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability. 158-181 - Gilles Bernot:
Good Functors... are Those Preserving Philosophy. 182-195 - Christoph Beierle, Angi Voß:
Viewing Implementations as an Institution. 196-218 - Simone Martini:
An Interval Model for Second-Order Lambda Calculus. 219-237 - Edmund Robinson:
Logical Aspects of Denotational Semantics. 238-253 - Maurizio Proietti:
Connections Between Partial Maps Categories and Triops Theory. 254-269 - Steven Vickers:
A Fixpoint Construction of the p-adic Domain. 270-289 - J. M. McDill, Austin Melton, George E. Strecker:
A Category of Galois Connections. 290-300
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.