| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465797603316 |
|
|
Titolo |
Category Theory and Computer Science [[electronic resource] ] : Edinburgh, UK, September 7-9, 1987. Proceedings / / edited by David H. Pitt, Axel Poigne, David E. Rydeheard |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1987.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 304 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 283 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Topology |
Computer logic |
Mathematical logic |
Logics and Meanings of Programs |
Mathematical Logic and Formal Languages |
Mathematical Logic and Foundations |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|
| |