Re: Functional Paradigm popularity and Maths (Was: XML as a transition to s-expr)

[address@hidden]

Doug Orleans <dougo@ccs.neu.edu> writes:

> I don't want to put words in Joe's mouth, but I understood "recursion
> and lists" to be much simpler than "discrete mathematics".  Like,
> here's a test you might give to an interviewee:
> 
> 1. Write a factorial function that doesn't use a looping construct.
> 
> 2. Choose a data structure for a collection of objects such that
>    insertion at the front is a constant-time operation.
> 
> While it would be great if everyone knew how to do proof by induction,
> you're right that that's not essential.  But I don't think that's what
> Joe was saying.

Exactly.  I'd be willing to have these words in my mouth (except that
they have been in someone else's).

~jrm