Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^2: How to answer "Perl is not secure" objections?

by radiantmatrix (Parson)
on Sep 06, 2007 at 21:57 UTC ( #637546=note: print w/ replies, xml ) Need Help??


in reply to Re: How to answer "Perl is not secure" objections?
in thread How to answer "Perl is not secure" objections?

See, I don't get to talk to Manager^3. I only get to hear the objections (filtered through others) and provide documentation to refute them.

<radiant.matrix>
Ramblings and references
The Code that can be seen is not the true Code
I haven't found a problem yet that can't be solved by a well-placed trebuchet


Comment on Re^2: How to answer "Perl is not secure" objections?
Re^3: How to answer "Perl is not secure" objections?
by CountZero (Bishop) on Sep 07, 2007 at 15:58 UTC
    Aye that's where the ugly bits and pieces of company and office politics rear their monstrous heads.

    CountZero

    A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (12)
As of 2014-12-21 13:59 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

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





    Results (105 votes), past polls