Category Theory and Computer Science
Springer Berlin (Verlag)
978-3-540-18508-6 (ISBN)
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.
Erscheint lt. Verlag | 21.10.1987 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | VIII, 304 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 474 g |
Themenwelt | Mathematik / Informatik ► Informatik |
Mathematik / Informatik ► Mathematik ► Geometrie / Topologie | |
Schlagworte | algorithms • Calculus • category theory • Computer • Computer Science • Hardware • Logic |
ISBN-10 | 3-540-18508-9 / 3540185089 |
ISBN-13 | 978-3-540-18508-6 / 9783540185086 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich