SkipCaptcha
265
edits
Changes
Jump to navigation
Jump to search
Line 40:
Line 40: + +
→Classifying programming languages: Turing-completeness
There are a variety of different programming paradigms (styles of writing programs). Some programming languages really only support a single paradigm while others may support several. Declarative programming has already been mentioned above. Other paradigms include: procedural, functional, event-driven, object-oriented and automata-based.
There are a variety of different programming paradigms (styles of writing programs). Some programming languages really only support a single paradigm while others may support several. Declarative programming has already been mentioned above. Other paradigms include: procedural, functional, event-driven, object-oriented and automata-based.
Languages associated with computers can also be classified as to whether or no they are Turing-complete, i.e. whether or not they are capable of expressing all possible computations (assuming enough time and memory). Examples of languages which are not Turing-complete include SQL for describing databases and markup languages such as HTML and XML.
==Implementation of programming languages==
==Implementation of programming languages==