Category theory and computer science : Paris, France, September 3-6, 1991 : proceedings
著者
書誌事項
Category theory and computer science : Paris, France, September 3-6, 1991 : proceedings
（Lecture notes in computer science, 530）
Springer-Verlag, c1991
- : gw
- : us
大学図書館所蔵 件 / 全52件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Papers presented at the fourth biennial Summer Conference on Category Theory and Computer Science, held in Paris, Sept. 3-6, 1991
Includes bibliographical references
内容説明・目次
内容説明
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.
目次
Stone 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.
「Nielsen BookData」 より