Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Re: I refuse to explain this

by petral (Curate)
on Apr 10, 2001 at 08:26 UTC ( #71259=note: print w/ replies, xml ) Need Help??


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

Hmmmm, looks kinda like unlambda (the lower case, anyway).

p


Comment on Re: Re: I refuse to explain this
Re: I refuse to explain this
by Dominus (Parson) on Apr 13, 2001 at 02:57 UTC
    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.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (10)
As of 2014-09-01 14:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite cookbook is:










    Results (13 votes), past polls