Question by Jorge: What is the difference between a stack based language and a static based language?
I don’t want examples of each…..Whats the difference as far as, a can-do languages use a heap to apportion memory at run time, stack base languages apportion memory at runtime, how do acan-do languages acquit? Please liken a stack established, can-do established, and acan-do language….I can’t really see the difference between a stack based language and a static language…. Thanks!

Best answer:

Answer by DesertStar
i think its static typed programming language and dynamic typed programming language.Most mainstream languages are adynamic type languages as they are typewritten checked up on before execution.. like if u r appending 2 adaptables than their types and types of the adaptable that is keeping the answer will be checked at roll up time.C++ and Java are static typed languages. while Ruby, Lisps are dynamically typed languages.For further scanning see wikipedia article

Add your own answer in the comments!