This book presents the proceedings of the Sixth International Conference on Category Theory and Computer Science, CTCS '95, held in Cambridge, UK in August 1995.The 15 revised full papers included in the volume document the exploitation of links between logic and category theory leading to a solid basis for much of the understanding of the semantics of computation. Notable amongst other advances is the introduction of linear logic and other substructural logics, providing a new approach to proof theory. Further aspects covered are semantics of lambda calculi and type theories, program specification and development, and domain theory.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 235 mm
Breite: 155 mm
Dicke: 17 mm
Gewicht
ISBN-13
978-3-540-18508-6 (9783540185086)
DOI
Schweitzer Klassifikation
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.
