I happened across this book while searching on the math/computer divide.
Discrete Mathematics Using a Computer
http://www.dcs.gla.ac.uk/~jtod/discrete-mathematics/
Here's the manual for the software tools (Haskell) used:
http://www.dcs.gla.ac.uk/~jtod/discrete-mathematics/StdmMan.pdf
A few of us have mentioned Haskell, a few attached, which the book
uses. Could any FRIAMers familiar with Haskell elaborate a bit more?
-- Owen
Owen Densmore http://backspaces.net
Begin forwarded message:
> From: "Eric Smith" <[EMAIL PROTECTED]>
> Date: December 28, 2006 7:50:44 AM MST
> To: The Friday Morning Applied Complexity Coffee Group
> <friam@redfish.com>
> Subject: Re: [FRIAM] Mathematical Search and Regular Expressions
>
> Hi Friam,
>
> Returning from music to the question of searching for mathematical
> expressions. This may be foolish, but what about using a functional
> programming language, such as Haskell, as a "standard format" for
> searchable math expressions? It reads enough like math that it
> wouldn't be very difficult to learn, and the context of an executable
> code ensures a form of validity testing by the person initiating the
> query (make sure it evaluates correctly on your own machine, then
> submit the code as a search string). It wouldn't be necessary that a
> search engine support all forms of representation initially; it would
> be enough to support one form in a useful way.
>
> I want to imagine, though this is not well thought out, that one wants
> a definitional language rather than an assignment language, even if
> evaluating the expression on some standard set of inputs would be one
> criterion for assigning it a mathematical "identity". Even better, of
> course, would be to have criteria for a "normal form" of some kind, so
> that among the possible changes of variable in a single equation,
> automatic conversions could select a particular one as the search
> standard. This would be along the lines of using a symbolic package
> as an engine to try to relate different representations of equivalent
> expressions.
>
> Does this add anything to what can be done now?
>
> Eric
Begin forwarded message:
> From: "Marcus G. Daniels" <[EMAIL PROTECTED]>
> Date: December 28, 2006 10:06:51 AM MST
> To: The Friday Morning Applied Complexity Coffee Group
> <friam@redfish.com>
> Subject: Re: [FRIAM] Mathematical Search and Regular Expressions
>
> Eric Smith wrote:
>> Returning from music to the question of searching for mathematical
>> expressions. This may be foolish, but what about using a functional
>> programming language, such as Haskell, as a "standard format" for
>> searchable math expressions?
> Some of the popular functional programming languages like ML (or
> OCaml)
> take the perspective that programmers may find it easier to think in
> terms of loops and side effects than recursion and monads, but even if
> that is true, programmers are not the concern. Mathematica is
> also one
> of these languages that can be used in a functional way but also
> provide
> imperative programming features. It might be tempting just to use
> Mathematica, but of course it's a proprietary thing, which might
> not be
> ideal for some environments or audiences. In contrast, Haskell is
> purely functional and a new set of conventions built on it would limit
> the risk that junk (that was hard to search or grok) could sneak in
> and
> complicate things..
Begin forwarded message:
> From: Carl Tollander <[EMAIL PROTECTED]>
> Date: April 20, 2005 10:22:44 AM MDT
> To: [EMAIL PROTECTED]
> Subject: [WedTech] more non-remunerative fun
> Reply-To: [EMAIL PROTECTED], [EMAIL PROTECTED]
>
> Just when I thought it was safe to start coding....
> http://lambda-the-ultimate.org
> http://etymon.blogspot.com/
> http://www.kimbly.com/blog/cat_languages.html
> These are language design blogs. Beware.
>
> Has anybody in the group played with the Haskell language?*
> *http://www.haskell.org*
> *There appears to be a lot of activity for future languages in
> the functional programming space. Haskell could clearly
> compete in terms of conciseness (concision?) with some of the
> scripting
> languages we've been considering.
>
> I came to the above links roundabout looking for prior work
> connecting RDF with Category Theory. Along the way,
> http://www.kowari.org/ ( a metadata storage facility ) might be
> worth checking out for
> its Jena hooks. One of the Kowari head programmers is
> doing a PhD thesis on Complexity (that's SFI-style definition) in
> emergent software metrics.
>
> carl
============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
