Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: I refuse to explain this

by Dominus (Parson)
on Apr 13, 2001 at 02:57 UTC ( #72228=note: print w/ replies, xml ) Need Help??

in reply to Re: Re: I refuse to explain this
in thread I refuse to explain this

Says petral:

looks kinda like unlambda
Wow, great catch!

I had forgetten all about unlambda, and I owe you big thanks for reminding me. You are absolutely correct. You can think of this program as an interpreter for a language very similar to unlambda. In particular, the I, `, S, and K have exactly the same meaning as in unlambda.

Now I don't have to refuse to explain the program; I can just point to the unlambda web pages. There are a bunch of variations here, but if you understand unlambda, it should be easy to understand this program. (That is something of a poisoned apple, because hardly anyone does understand unlambda.)

Everyone should give petral a big ++ on this for being so clever.

Comment on Re: I refuse to explain this

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://72228]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (8)
As of 2014-12-26 05:28 GMT
Find Nodes?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?

    Results (165 votes), past polls