Re: Category Theory of Algorithms
- From: Jym <Jean-Yves.Moyen+news@xxxxxxxxxxxx>
- Date: Mon, 09 Apr 2007 20:15:10 +0200
On Mon, 09 Apr 2007 01:20:47 +0200, the.theorist <the.theorist@xxxxxxxxx> wrote:
Category Theory has been really nice for the study of type systems,
and for providing a lens with which to view mathematics, and the
relationship between mathematical objects. Has it been applied to the
study of the mathematical properties of algorithms (as a mathematical
object)? I wasn't able to find a strong link between the two
disciplines using google, (maybe I'm barking up the wrong tree?)
Can anyone recommend some textbooks in this area? And what are the
current thoughts on what is needed for the transition to the parallel
paradigm?
I think there is a "Category theory for computer science" (or similar title) by Barr & Wells, but I'm not quite sure this deals with the ideas your explaining.
--
Hypocoristiquement,
Jym.
.
- Follow-Ups:
- Re: Category Theory of Algorithms
- From: Pummelo
- Re: Category Theory of Algorithms
- References:
- Category Theory of Algorithms
- From: the.theorist
- Category Theory of Algorithms
- Prev by Date: Theoretical Computer Science Search Engine
- Next by Date: Re: Category Theory of Algorithms
- Previous by thread: Category Theory of Algorithms
- Next by thread: Re: Category Theory of Algorithms
- Index(es):
Relevant Pages
|