Matthew Podwysocki's Blog - All Comments

New and Notable 251

Sam Gentile The World According to MSCOREE — Sat, 12 Jul 2008 15:49:32 GMT

.NET/C#/Functional Programming The very useful CR_Documentor 2.0 has been released with Sandcastle Preview

Link Listing - July 10, 2008

Christopher Steen — Fri, 11 Jul 2008 07:28:41 GMT

Link Listing - July 10, 2008

Dew Drop - July 10, 2008 | Alvin Ashcraft's Morning Dew

Dew Drop - July 10, 2008 | Alvin Ashcraft's Morning Dew — Thu, 10 Jul 2008 12:09:34 GMT

Pingback from Dew Drop - July 10, 2008 | Alvin Ashcraft's Morning Dew

re: Concurrency with MPI in .NET

podwysocki — Tue, 08 Jul 2008 02:09:22 GMT

@Doug

I've used them several times with a bit of success, so I'd be in favor of at least supporting it, but, yes, it's not widely used.

Matt

re: Concurrency with MPI in .NET

podwysocki — Tue, 08 Jul 2008 02:08:44 GMT

@Gal C

I hope to cover this soon as I relook at MPI.NET again.

Matt

re: Concurrency with MPI in .NET

Doug Gregor — Thu, 03 Jul 2008 21:17:49 GMT

Do you really need buffered and ready sends? In my experience with MPI, these features are very rarely used and then are typically used incorrectly.

re: Define Recursion - See Recursion

podwysocki — Wed, 02 Jul 2008 13:23:42 GMT

@Scrooge

You're right, that wasn't the example I was going to post on tail recursion, and I had a sample missing. It has been corrected to add an additional sample of this:

let rec last l =

match l with

| [] -> invalid_arg “l”

| [head] -> head

| head :: tail -> last tail

Matt

Dew Drop - July 2, 2008 | Alvin Ashcraft's Morning Dew

Dew Drop - July 2, 2008 | Alvin Ashcraft's Morning Dew — Wed, 02 Jul 2008 12:44:27 GMT

Pingback from Dew Drop - July 2, 2008 | Alvin Ashcraft's Morning Dew

re: Define Recursion - See Recursion

drscroogemcduck — Wed, 02 Jul 2008 07:39:10 GMT

i don't think that factorial is tail recursive. i thought tail recursive was when the last thing you do before returning is calling yourself. however, in your factorial you do a multiply operation before returning.

this one is definitely tail recursive:

int factorial'(int acc, int n) :

if (n <= 1) return acc

return factorial(acc * n, n - 1);

int factorial(int n):

return factorial'(1, n)

我眼中的C# 3.0

眼里无神 — Wed, 02 Jul 2008 02:31:26 GMT

缘起

每次有新技术发布时，我们总能感受到两种截然不同的情绪：

一种是恐惧和抵抗，伴随着这种情绪的还有诸如