دانلود کتاب Category Theory and Computer Science: Edinburgh, U.K., September 7–9, 1987 Proceedings

فهرست مطالب :

Categories and effective computations....Pages 1-11
Polymorphism is set theoretic, constructively....Pages 12-39
An equational presentation of higher order logic....Pages 40-56
Enriched categories for local and interaction calculi....Pages 57-70
The category of Milner processes is exact....Pages 71-97
Relating two models of hardware....Pages 98-113
Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms....Pages 114-139
A typed lambda calculus with categorical type constructors....Pages 140-157
Final algebras, cosemicomputable algebras, and degrees of unsolvability....Pages 158-181
Good functors ... are those preserving philosophy!....Pages 182-195
Viewing implementations as an institution....Pages 196-218
An interval model for second order lambda calculus....Pages 219-237
Logical aspects of denotational semantics....Pages 238-253
Connections between partial maps categories and tripos theory....Pages 254-269
A fixpoint construction of the p-adic domain....Pages 270-289
A category of Galois connections....Pages 290-300