Category Theory and Computer Science: Paris, France, September 3-6, 1991. Proceedings - Couverture souple
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
