Category Theory and Computer Science Edinburgh, U.K., September 7–9, 1987 Proceedings / [electronic resource] :
edited by David H. Pitt, Axel Poigné, David E. Rydeheard.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 1987.
- VIII, 304 p. online resource.
- Lecture Notes in Computer Science, 283 0302-9743 ; .
- Lecture Notes in Computer Science, 283 .
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.
9783540480068
10.1007/3-540-18508-9 doi
Computer science.
Logic design.
Logic, Symbolic and mathematical.
Computer Science.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Mathematical Logic and Foundations.
QA76.9.L63 QA76.5913 QA76.63
005.1015113
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.
9783540480068
10.1007/3-540-18508-9 doi
Computer science.
Logic design.
Logic, Symbolic and mathematical.
Computer Science.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Mathematical Logic and Foundations.
QA76.9.L63 QA76.5913 QA76.63
005.1015113