Category theory and computer science : Edinburgh, U.K., September 7-9, 1987, proceedings
Author(s)
Bibliographic Information
Category theory and computer science : Edinburgh, U.K., September 7-9, 1987, proceedings
（Lecture notes in computer science, 283）
Springer-Verlag, c1987
- : gw
- : us
Available at 58 libraries
Note
Includes bibliographies
Description and Table of Contents
Table of Contents
Categories and effective computations.- Polymorphism is set theoretic, constructively.- An equational presentation of higher order logic.- Enriched categories for local and interaction calculi.- The category of Milner processes is exact.- Relating two models of hardware.- Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms.- A typed lambda calculus with categorical type constructors.- Final algebras, cosemicomputable algebras, and degrees of unsolvability.- Good functors ... are those preserving philosophy!.- Viewing implementations as an institution.- An interval model for second order lambda calculus.- Logical aspects of denotational semantics.- Connections between partial maps categories and tripos theory.- A fixpoint construction of the p-adic domain.- A category of Galois connections.
by "Nielsen BookData"