Category Theory and Computer Science

Edinburgh, UK, September 7-9, 1987. Proceedings

312 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Informatik Theoretische Informatik
• ISBN: 9783540185086
• Sprache: Englisch
• Erscheinungsdatum: 21.10.1987
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: David E. Rydeheard, David H. Pitt, Axel Poigne