Category Theory and Computer Science: Paris, France, September 3-6, 1991. Proceedings / Edition 1by David H. Pitt
Pub. Date: 09/24/1991
Publisher: Springer Berlin Heidelberg
Science, held in Paris, September3-6, 1991. Category theory continues to be an important tool in foundationalstudies in computer science. It has been widely applied by logicians to get concise interpretations of many logical concepts. Links between
The papers in this volume were presented at the fourth biennial Summer Conference on Category Theory and Computer
Science, held in Paris, September3-6, 1991. Category theory continues to be an important tool in foundationalstudies in computer science. It has been widely applied by logicians to get concise interpretations of many logical concepts. Links between logic and computer science have been developed now for over twenty years, notably via the Curry-Howard isomorphism which identifies programs with proofs and types with propositions. The triangle category theory - logic -
programming presents a rich world of interconnections.
Topics covered in this volume include the following. Type theory: stratification of types and propositions can be discussed in a categorical setting. Domain theory: synthetic domain theory develops domain theory internally in the constructive universe of the effective topos. Linear logic:
the reconstruction of logic based on propositions as resources leads to alternatives to traditional syntaxes. The proceedings of the previous three category theory conferences appear as Lecture Notes in Computer Science
Volumes 240, 283 and 389.
Table of ContentsStone duality for stable functions.- Bifinite domains: Stable case.- Local variables and non-interference in algol-like languages.- Categories of information systems.- Collapsing graph models by preorders.- Linear logic and interference control.- Higher dimensional word problem.- BCK-formulas having unique proofs.- Proof nets and coherence theorems.- A modular approach to denotational semantics.- Programs in partial algebras A categorical approach.- Tail recursion from universal invariants.- A direct proof of the intuitionistic Ramsey Theorem.- Constructions and predicates.- Relating models of impredicative type theories.- Two results on set-theoretic polymorphism.- An algebra of graphs and graph rewriting.- Dataflow networks are fibrations.- Applications of the calculus of trees to process description languages.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >