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

Re^4: PERLISP meditations

by protist (Monk)
on Sep 29, 2012 at 15:46 UTC ( #996396=note: print w/ replies, xml ) Need Help??

in reply to Re^3: PERLISP meditations
in thread PERLISP meditations

The lisp example was recursive, so I made mine recursive. This is nebulous, abstract, and subjective. I realize this. I was attempting to model the Perl program after the logic of the LISP program as written, not after its compiled representation. I was attempting to "think in LISP" while programming in Perl.

Regardless of its utility, I provided a flexible next() because the LISP example did. I would add, however, that the flexible next is still compatible with the normal comparison as written for many types of iterations, in so long as the iterations cause A to increase, and have either no upper bound or an upper bound above B.

Comment on Re^4: PERLISP meditations

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (7)
As of 2015-10-13 22:09 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (316 votes), past polls