I study SQL::Library and do SQL::Query But sometimes I find SQL::Abstract and even with SQL::Beautify Hey::MySQL I prefer to think DBM::Deep.

print+qq(\L@{[ref\&@]}@{['@'x7^'!#2/"!4']});

Replies are listed 'Best First'.
Re: Ode to SQL
by zentara (Cardinal) on Mar 17, 2009 at 12:28 UTC
    Update: a fews minute later: I will call this the Jeep Language. for
    Joe's Excellent Extrasensory Protocol . :-)

    Hi, it's not very Perl::like in language::structure but a cool improvement to identifing word::connotation Imagine( 'a language that appends connotation to words')
    my point is that this could be the basis for a new artificial intelligence language, which precisely ( unless FUBAR'd :-) ) convey exact meaning to a word with many meanings. So something like
    Gort: Please turn on the Toaster:bread:! world_burner
    and the separator to connotation would be a chr(Ox1), and deeper nesting with chr(++). Then you could transmit info to robots the exact info you want it to do, with no ambiguity. Now "ambiguity" (fixed spelling) is a hard question to deal with. I'm working on a Tk gui to simulate how a qauntuum tunnel link may be able to pass digital information. I got the idea from watching how the swivel head walker wheels pivot and slip on a waxy floor, and how it performs "slipage wise"

    That slippage is the ambiguity. A tight link has zero slippage... zero ambiguity. The real world has circular ambiguity for certain, but the slippage could be 3-d or even 4-d. !!

    Oops, I forgot these are the detailed plans for my space-time roomba......cleaning up fabric-tears. :-)

    Yes, my life has ultimately brought me to this. :-( On my knees, contemplating travel on the astral plane.


    I'm not really a human, but I play one on earth My Petition to the Great Cosmic Conciousness