tag:blogger.com,1999:blog-6555947.post115662150007378624..comments2024-03-14T01:32:43.610-06:00Comments on The Geomblog: A language for computational topologySuresh Venkatasubramanianhttp://www.blogger.com/profile/15898357513326041822noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-6555947.post-1156814279622326032006-08-28T19:17:00.000-06:002006-08-28T19:17:00.000-06:00Ken,Actually, besides writing the homology code I'...Ken,<BR/><BR/>Actually, besides writing the homology code I've also written power series code and a tiny combinatorics library that makes use of it (the code for the latter seems to have become slightly garbled - I'll fix it).<BR/><BR/><A HREF="http://homepage.mac.com/sigfpe/Computing/haskell.html" REL="nofollow">Here</A>.<BR/><BR/>Funnily enough I've also implemented regular expression code based on the Brzozowski derivative. There's something about Haskell that leads people towards implementing the same kinds of projects...sigfpehttps://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-6555947.post-1156772098831674002006-08-28T07:34:00.000-06:002006-08-28T07:34:00.000-06:00Regarding Haskell, if not computational topology: ...Regarding Haskell, if not computational topology: Doug McIlroy has some papers using Haskell as a clean represenation for <A HREF="http://www.cs.dartmouth.edu/~doug/pearl.ps.gz" REL="nofollow">power series</A>  (see also <A HREF="http://www.cs.dartmouth.edu/~doug/short.ps.gz" REL="nofollow">here</A>) and <A HREF="http://www.cs.dartmouth.edu/~doug/nfa.ps.gz" REL="nofollow">enumerating strings of a regular language</A> <BR/><BR/><A></A><A></A>Posted by<A><B> </B></A><A HREF="http://geomblog.blogspot.com/2006/08/language-for-computational-topology.html#comments" REL="nofollow" TITLE="ken dot clarkson at gmail dot com">Ken Clarkson</A>Anonymousnoreply@blogger.com