HjemGrupperSnakMereZeitgeist
Søg På Websted
På dette site bruger vi cookies til at levere vores ydelser, forbedre performance, til analyseformål, og (hvis brugeren ikke er logget ind) til reklamer. Ved at bruge LibraryThing anerkender du at have læst og forstået vores vilkår og betingelser inklusive vores politik for håndtering af brugeroplysninger. Din brug af dette site og dets ydelser er underlagt disse vilkår og betingelser.

Resultater fra Google Bøger

Klik på en miniature for at gå til Google Books

Indlæser...

Basic Category Theory for Computer Scientists

af Benjamin C. Pierce

MedlemmerAnmeldelserPopularitetGennemsnitlig vurderingSamtaler
1642165,320 (3.38)Ingen
Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Benjamin C. Pierce received his doctoral degree from Carnegie Mellon University. Contents : Tutorial. Applications. Further Reading.… (mere)
Ingen
Indlæser...

Bliv medlem af LibraryThing for at finde ud af, om du vil kunne lide denne bog.

Der er ingen diskussionstråde på Snak om denne bog.

Viser 2 af 2
Terse. Maybe too terse, but a lot of my issues would have been resolved had I realized there was an appendix of notation at the back of the book. Serves as a pretty solid introduction to category theory, but provides absolutely no indication as to *why one might want to know category theory*. The treatment is primarily for organizing ones thoughts about abstract structures rather than actually working with them. The book very briefly mentions representability, with no discussion of the Yoneda lemma (which I understand to be one of the more useful parts of category theory).

I read this as part of MIRI's recommended reading list. ( )
  isovector | Dec 13, 2020 |
I believe this is an excellent introduction to Category theory, and I believe that *someday* I'll make it through this book. But considered as applied mathematics, I just don't get the point of the high level of abstraction, though there must be something to it because the type theory and programming language communities have adopted it with great glee. ( )
1 stem nillacat | Oct 15, 2007 |
Viser 2 af 2
ingen anmeldelser | tilføj en anmeldelse
Du bliver nødt til at logge ind for at redigere data i Almen Viden.
For mere hjælp se Almen Viden hjælpesiden.
Kanonisk titel
Oplysninger fra den engelske Almen Viden Redigér teksten, så den bliver dansk.
Originaltitel
Alternative titler
Oprindelig udgivelsesdato
Personer/Figurer
Vigtige steder
Vigtige begivenheder
Beslægtede film
Indskrift
Tilegnelse
Første ord
Citater
Sidste ord
Oplysning om flertydighed
Forlagets redaktører
Bagsidecitater
Originalsprog
Canonical DDC/MDS
Canonical LCC

Henvisninger til dette værk andre steder.

Wikipedia på engelsk (3)

Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Benjamin C. Pierce received his doctoral degree from Carnegie Mellon University. Contents : Tutorial. Applications. Further Reading.

No library descriptions found.

Beskrivelse af bogen
Haiku-resume

Current Discussions

Ingen

Populære omslag

Quick Links

Vurdering

Gennemsnit: (3.38)
0.5
1
1.5
2 2
2.5
3 5
3.5 1
4 3
4.5 1
5 1

Er det dig?

Bliv LibraryThing-forfatter.

 

Om | Kontakt | LibraryThing.com | Brugerbetingelser/Håndtering af brugeroplysninger | Hjælp/FAQs | Blog | Butik | APIs | TinyCat | Efterladte biblioteker | Tidlige Anmeldere | Almen Viden | 203,239,417 bøger! | Topbjælke: Altid synlig