Solved DAO Workspace Database Collection

Stored Procedure has a specific, defined meaning and usage. It's an object in a SQL Server database, not part of the Access development environment.

Also found in ORACLE. My experience was specific to ORACLE Enterprise Server.
 
Also found in ORACLE. My experience was specific to ORACLE Enterprise Server.
Yes, sorry. I lost that point in the overall context. However, being precise about definition requires that be clear as well.
 
GPGeorge:
Since you were kind enough to go to all the trouble to put out those definitions, and since I'm posting on this forum, I'll do my best in any future posts to follow those definitions to keep that thread on track.

Not to cause another off-topic discussion, but:
But arguably the most-debated topic surrounding SQL is whether or not it is considered a programming language.
In that regard here is one persons take. I haven't registered on that site, so don't know all his arguements, or any conclusion reached,
but found the title

10 Reasons Why SQL Is and Is Not a Programming Language​

likely to present both sides of the discussion. Since I can't post a link, I include it as a quote without the https prefix., if of interest.
medium.com/learning-sql/10-reasons-why-sql-is-and-is-not-a-programming-language-d6ccbea2e484
 
If you follow the implied link, it wants you to sign up to see the whole article.

The answer to dw85745's bold-faced question must start with a counter-question: "Whose definition of 'Programming Language' are you using?"

By most of the standards I have seen, SQL is a programming language but is not a general purpose programming language.

The languages used by programmable logic controllers count as languages (there are 5 commonly used variants). The language used by certain types of flat-bed plotters counts as a language (variants based on HPGL and its later generations). The language used by CNC routers is a language. ALL of the examples listed here are Domain-Specific Languages. Most if not all of them would fall in the same place when considering the Goedel Completeness Theorem - they are "incomplete" and therefore their correctness is theoretically provable.

In fact, there is a whole specialized branch of logic - called interrogatory logic - that analyzes the validity of answers given by such languages. That branch asks the question: Does this answer satisfy this question? The contrary form asks: Does this question condone this answer? Interrogatory logic is the companion to the more familiar "assertoric logic" that examines the validity of assertions.
 

Users who are viewing this thread

Back
Top Bottom